Superlinear convergence of a stabilized SQP method to a degenerate solution
From MaRDI portal
Recommendations
- A stabilized SQP method: superlinear convergence
- Modifying SQP for Degenerate Problems
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
Cited in
(77)- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems
- Two-step and three-step Q-superlinear convergence of SQP methods
- On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- Critical solutions of nonlinear equations: local attraction for Newton-type methods
- Error bounds and finite termination for constrained optimization problems
- A globally convergent Levenberg-Marquardt method for equality-constrained optimization
- Local analysis of a new multipliers method
- A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- Subspace-stabilized sequential quadratic programming
- Unit stepsize for the Newton method close to critical solutions
- Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations
- Constrained Lipschitzian error bounds and noncritical solutions of constrained equations
- Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers
- A regularization method for constrained nonlinear least squares
- Superlinear convergence of the sequential quadratic method in constrained optimization
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- Newton-type methods near critical solutions of piecewise smooth nonlinear equations
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- Newton-type methods: a broader view
- Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- An inexact restoration strategy for the globalization of the sSQP method
- Convergence of a stabilized SQP method for equality constrained optimization
- A sequential quadratically constrained quadratic programming method of feasible directions
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Sharp primal superlinear convergence results for some Newtonian methods for constrained optimization
- A stabilized filter SQP algorithm for nonlinear programming
- Primal and dual active-set methods for convex quadratic programming
- Implementing a smooth exact penalty function for equality-constrained nonlinear optimization
- Newton's method may fail to recognize proximity to optimal points in constrained optimization
- scientific article; zbMATH DE number 4047434 (Why is no real title available?)
- Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
- Stabilized SQP revisited
- A special complementarity function revisited
- A regularized factorization-free method for equality-constrained optimization
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- Modifying SQP for Degenerate Problems
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- Sequential quadratic programming methods for parametric nonlinear optimization
- Primal-dual active-set methods for large-scale optimization
- A globally convergent regularized interior point method for constrained optimization
- Sequential quadratic optimization for nonlinear optimization problems on Riemannian manifolds
- Adjusting dual iterates in the presence of critical Lagrange multipliers
- Local and global analysis of multiplier methods for constrained optimization in Banach spaces
- A stabilized SQP method: superlinear convergence
- Convergence of the BFGS-SQP Method for Degenerate Problems
- Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions
- scientific article; zbMATH DE number 6027003 (Why is no real title available?)
- A reduced Hessian SQP method for inequality constrained optimization
- Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- Newton-type methods for constrained optimization with nonregular constraints
- A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces
- A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization
- On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
- Stabilized SQP Methods in Hilbert Spaces
- Behavior of Newton-type methods near critical solutions of nonlinear equations with semismooth derivatives
- Superlinear convergence of a stabilized SQP-type method for nonlinear semidefinite programming
- Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification
- Hybrid globalization of convergence of the Levenberg-Marquardt method for equality-constrained optimization problems
- Techniques for adjusting dual iterates in the presence of critical Lagrange multipliers for optimization problems with inequality constraints
- A second-order sequential optimality condition for nonlinear second-order cone programming problems
- A general perturbed Newtonian framework and critical solutions of nonlinear equations
- Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
- Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
- Combining stabilized SQP with the augmented Lagrangian algorithm
- A Fast Algorithm for Maximum Likelihood Estimation of Mixture Proportions Using Sequential Quadratic Programming
- On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
This page was built for publication: Superlinear convergence of a stabilized SQP method to a degenerate solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273525)