On the global convergence of interior-pointnonlinear programming algorithms
From MaRDI portal
Publication:5962399
DOI10.1590/S1807-03022010000200003zbMath1202.90240MaRDI QIDQ5962399
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
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C51: Interior-point methods
49K99: Optimality conditions
Related Items
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 second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, 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