Globally Convergent Interior-Point Algorithm for Nonlinear Programming

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.125, Iss.3, 2005-06, pp. : 497-521

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A primal-dual interior-point algorithm for quadratic programming

By Dominguez Juan González-Lima María

Numerical Algorithms, Vol. 42, Iss. 1, 2006-05 ,pp. : 1-30

Springer Publishing Company

Access to resources Recommend Favorite

On the Newton Interior-Point Method for Nonlinear Programming Problems

By Durazzi C.

Journal of Optimization Theory and Applications, Vol. 104, Iss. 1, 2000-01 ,pp. : 73-90

Springer Publishing Company

Access to resources Recommend Favorite

A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming

By Shen Chungen

International Journal of Computer Mathematics, Vol. 86, Iss. 12, 2009-12 ,pp. : 2201-2217

Taylor & Francis Ltd

Access to resources Recommend Favorite

Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming

By Recht P. Schade P.H.

Optimization, Vol. 56, Iss. 4, 2007-08 ,pp. : 495-514

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming

By Yang Yaguang

Journal of Optimization Theory and Applications, Vol. 158, Iss. 3, 2013-09 ,pp. : 859-873

Springer Publishing Company

Access to resources Recommend Favorite