On the global convergence of interior-pointnonlinear programming algorithms

DOI10.1590/S1807-03022010000200003zbMath1202.90240OpenAlexW2169434691MaRDI QIDQ5962399

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)

Related Items

A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications ⋮ A relaxed constant positive linear dependence constraint qualification and applications ⋮ A nonlinear interval portfolio selection model and its application in banks ⋮ A twist on SLP algorithms for NLP and MINLP problems: an application to gas transmission networks