On the global convergence of interior-pointnonlinear programming algorithms
From MaRDI portal
Publication:5962399
DOI10.1590/S1807-03022010000200003zbMATH Open1202.90240OpenAlexW2169434691MaRDI QIDQ5962399FDOQ5962399
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
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51) Optimality conditions (49K99)
Cited In (14)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 regularized interior point method for constrained optimization
- A globally convergent interior point algorithm for non-convex nonlinear programming
- 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
Recommendations
- An Interior-Point $$\boldsymbol{\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 π π
- Title not available (Why is that?) π π
- A penalty-interior-point algorithm for nonlinear constrained optimization π π
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)