Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems

DOI10.1007/s10589-005-2177-xzbMath1089.90060OpenAlexW2073783149MaRDI QIDQ812412

Hiroshi Yabe, Hiroshi Yamashita

Publication date: 23 January 2006

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

Full work available at URL: https://doi.org/10.1007/s10589-005-2177-x

zbMATH Keywords

quadratic convergenceprimal-dual interior point methoddegenerate nonlinear optimization

Mathematics Subject Classification ID

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

Related Items

An SQP-type algorithm for nonlinear second-order cone programs, Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production, Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization

Cites Work

• Unnamed Item
• Superlinear convergence of a stabilized SQP method to a degenerate solution
• Stabilized sequential quadratic programming
• Stability in the presence of degeneracy and error estimation
• Local convergence of interior-point algorithms for degenerate monotone LCP
• Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
• Error bounds in mathematical programming
• Local convergence of a primal-dual method for degenerate nonlinear programming
• On the convergence rate of Newton interior-point methods in the absence of strict complementarity
• 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
• Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
• Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION
• A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables
• Modifying SQP for Degenerate Problems
• A globally convergent primal-dual interior point method for constrained optimization
• Properties of the Log-Barrier Function on Degenerate Nonlinear Programs