Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
From MaRDI portal
Publication:812412
DOI10.1007/S10589-005-2177-XzbMATH Open1089.90060OpenAlexW2073783149MaRDI QIDQ812412FDOQ812412
Authors: Hiroshi Yamashita, Hiroshi Yabe 
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
Recommendations
- Local convergence of a primal-dual method for degenerate nonlinear programming
- Quadratic convergence of potential-reduction methods for degenerate problems
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- scientific article; zbMATH DE number 2064336
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
Cites Work
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stability in the presence of degeneracy and error estimation
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Error bounds in mathematical programming
- Stabilized sequential quadratic programming
- Modifying SQP for Degenerate Problems
- Superlinear convergence of an interior-point method despite dependent constraints
- Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A globally convergent primal-dual interior point method for constrained optimization
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Title not available (Why is that?)
- On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear 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
- Effects of finite-precision arithmetic on interior-point methods for nonlinear programming
- A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables
Cited In (9)
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
- On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
- Local convergence of a primal-dual method for degenerate nonlinear programming
- Evolutionary techniques applied to the optimal short-term scheduling of the electrical energy production
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- Quadratic convergence of potential-reduction methods for degenerate problems
- An SQP-type algorithm for nonlinear second-order cone programs
This page was built for publication: Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812412)
