Stabilized sequential quadratic programming
From MaRDI portal
Publication:1294816
DOI10.1023/A:1008640419184zbMath1040.90566OpenAlexW2153993279MaRDI QIDQ1294816
Publication date: 1999
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008640419184
sequential quadratic programmingerror estimationquadratic convergencesuperlinear convergencestabilized SQPdegenerate optimization
Related Items (43)
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function ⋮ Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints ⋮ An inexact restoration strategy for the globalization of the sSQP method ⋮ A stabilized filter SQP algorithm for nonlinear programming ⋮ An infeasible nonmonotone SSLE algorithm for nonlinear programming ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ Combining stabilized SQP with the augmented Lagrangian algorithm ⋮ Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions ⋮ A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs ⋮ Convergence of a stabilized SQP method for equality constrained optimization ⋮ An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions ⋮ An interior point method for nonlinear optimization with a quasi-tangential subproblem ⋮ On the cost of solving augmented Lagrangian subproblems ⋮ On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers ⋮ Newton-type methods for constrained optimization with nonregular constraints ⋮ A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces ⋮ A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems ⋮ Stabilized SQP revisited ⋮ Critical solutions of nonlinear equations: local attraction for Newton-type methods ⋮ A primal-dual augmented Lagrangian ⋮ A special complementarity function revisited ⋮ Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems ⋮ Error bounds and finite termination for constrained optimization problems ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization ⋮ A globally convergent Levenberg-Marquardt method for equality-constrained optimization ⋮ Newton-type methods near critical solutions of piecewise smooth nonlinear equations ⋮ Primal-dual active-set methods for large-scale optimization ⋮ A Regularized Factorization-Free Method for Equality-Constrained Optimization ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions ⋮ A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems ⋮ Newton-type methods: a broader view ⋮ Subspace-stabilized sequential quadratic programming ⋮ Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming ⋮ Constrained Lipschitzian error bounds and noncritical solutions of constrained equations ⋮ Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces ⋮ Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it ⋮ 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
This page was built for publication: Stabilized sequential quadratic programming
