On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming

DOI10.1023/A:1015451203254MaRDI QIDQ700757zbMATH OpenFDO

Authors M. Argáez, Richard Tapia

Publication date 8 October 2002

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1015451203254

zbMATH Keywords

augmented Lagrangianinterior-point methodsNewton methodnonlinear programming problemsnumerical testsprimal-dual methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Recommendations

• Global convergence of the Newton interior-point method for nonlinear programming
• On the Newton interior-point method for nonlinear programming problems
• Global convergence of an interior-point potential reduction algorithm for nonlinear programming problems
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions

Cites work

• scientific article; zbMATH DE number 3140820 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• More test examples for nonlinear programming codes
• On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs
• Test examples for nonlinear programming codes

Cited in

(14)

• Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
• A penalized interior point approach for constrained nonlinear programming
• Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming
• A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems
• On central-path proximity measures in interior-point methods
• Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production
• A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
• A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
• Improving ultimate convergence of an augmented Lagrangian method
• An interior-point trust-funnel algorithm for nonlinear optimization
• On second-order optimality conditions 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 a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming

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