Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization

DOI10.1007/BF02592190zbMath0874.90175MaRDI QIDQ1363416

Hiroshi Yabe, Hiroshi Yamashita

Publication date: 7 August 1997

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

primal-dual interior point methods; nonlinearly constrained optimization; local convergence rates

Mathematics Subject Classification ID

90C30: Nonlinear programming

Related Items

Local convergence of the interior-point Newton method for general nonlinear programming, Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming, Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems, A local convergence analysis of bilevel decomposition algorithms, An interior-point algorithm for computing equilibria in economies with incomplete asset markets, A note on the use of vector barrier parameters for interior-point methods, A local convergence property of primal-dual methods for nonlinear programming, An interior-point algorithm for nonlinear minimax problems, Convergence analysis of a nonlinear Lagrangian algorithm for nonlinear programming with inequality constraints, Advances in design and implementation of optimization software, A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, A truncated Newton method in an augmented Lagrangian framework for nonlinear programming, Local analysis of the feasible primal-dual interior-point method, A primal-dual interior-point algorithm for nonlinear least squares constrained problems, On interior-point Newton algorithms for discretized optimal control problems with state constraints^∗

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational experience with a primal-dual interior point method for linear programming
• Test examples for nonlinear programming codes
• A primal-dual infeasible-interior-point algorithm for linear programming
• Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• Primal-Dual and Primal Interior Point Algorithms for General Nonlinear Programs
• On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems