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

DOI10.1023/A:1015451203254zbMath1009.90111MaRDI QIDQ700757

M. Argáez, Richard A. Tapia

Publication date: 8 October 2002

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

zbMATH Keywords

numerical testsinterior-point methodsNewton methodaugmented Lagrangiannonlinear programming problemsprimal-dual methods

Mathematics Subject Classification ID

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

Related Items

On central-path proximity measures in interior-point methods, An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems, Distributed optimal control of nonlinear systems using a second-order augmented Lagrangian method, A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems, Improving ultimate convergence of an augmented Lagrangian method, Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production, An interior-point trust-funnel algorithm for nonlinear optimization, Penalized interior point approach for constrained nonlinear programming, On second-order optimality conditions for nonlinear programming, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• 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
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods
• Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs