Modifying SQP for Degenerate Problems
From MaRDI portal
Publication:4785890
DOI10.1137/S1052623498333731zbMath1026.90097MaRDI QIDQ4785890
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Methods of successive quadratic programming type (90C55)
Related Items
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, A globally convergent regularized interior point method for constrained optimization, A stable primal-dual approach for linear programming under nondegeneracy assumptions, Convergence of the BFGS-SQP Method for Degenerate Problems, Newton's method may fail to recognize proximity to optimal points in constrained optimization, Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions, First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition, A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, Convergence of a stabilized SQP method for equality constrained optimization, An interior point method for nonlinear optimization with a quasi-tangential subproblem, 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 quasi-Newton strategy for the SSQP method for variational inequality and optimization problems, Stabilized SQP revisited, A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties, Nonlinear robust optimization via sequential convex bilevel programming, Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems, Improving ultimate convergence of an augmented Lagrangian method, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, A globally convergent Levenberg-Marquardt method for equality-constrained optimization, Primal-dual active-set methods for large-scale optimization, On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions, A stabilized SQP method: superlinear convergence, A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems, A reduced Hessian SQP method for inequality constrained optimization, 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, On the behaviour of constrained optimization methods when Lagrange multipliers do not exist, Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming, An SQP algorithm with cautious updating criteria for nonlinear degenerate problems, Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces, Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
