On the global convergence of interior-pointnonlinear programming algorithms

DOI10.1590/S1807-03022010000200003MaRDI QIDQ5962399zbMATH OpenOpenAlexFDO

Authors Gabriel Haeser

Publication date 22 September 2010

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1590/s1807-03022010000200003

zbMATH Keywords

constraint qualifications

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51) Optimality conditions (49K99)

Recommendations

• An interior-point \(\ell_1\)-penalty method for nonlinear optimization
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
• Global convergence of the Newton interior-point method for nonlinear programming
• scientific article; zbMATH DE number 5524381
• A penalty-interior-point algorithm for nonlinear constrained optimization

Cited in

(14)

• scientific article; zbMATH DE number 556481 (Why is no real title available?)
• scientific article; zbMATH DE number 1183039 (Why is no real title available?)
• A relaxed constant positive linear dependence constraint qualification and applications
• A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
• A globally convergent interior point algorithm for non-convex nonlinear programming
• A globally convergent regularized interior point method for constrained optimization
• A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks
• Failure of global convergence for a class of interior point methods for nonlinear programming
• A nonlinear interval portfolio selection model and its application in banks
• Local convergence of the interior-point Newton method for general nonlinear programming
• On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications
• Global convergence enhancement of classical linesearch interior point methods for MCPs
• Local convergence of the affine-scaling interior-point algorithm for nonlinear programming
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties

This page was built for publication: On the global convergence of interior-pointnonlinear programming algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962399)