Superlinear convergence of a stabilized SQP method to a degenerate solution
From MaRDI portal
Publication:1273525
DOI10.1023/A:1018665102534zbMath0917.90279MaRDI QIDQ1273525
Publication date: 18 May 1999
Published in: Computational Optimization and Applications (Search for Journal in Brave)
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, The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, A stabilized filter SQP algorithm for nonlinear programming, Primal and dual active-set methods for convex quadratic programming, A globally convergent regularized interior point method for constrained optimization, Convergence of the BFGS-SQP Method for Degenerate Problems, Newton's method may fail to recognize proximity to optimal points in constrained optimization, Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds, 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, A regularization method for constrained nonlinear least squares, 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, A revised sequential quadratic semidefinite programming method for nonlinear semidefinite optimization, Adjusting Dual Iterates in the Presence of Critical Lagrange Multipliers, Stabilized SQP revisited, Critical solutions of nonlinear equations: local attraction for Newton-type methods, 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, Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions, 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, Sequential quadratic programming methods for parametric nonlinear optimization, A globally convergent Levenberg-Marquardt method for equality-constrained optimization, Newton-type methods near critical solutions of piecewise smooth nonlinear equations, Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization, 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 stabilized SQP method: superlinear convergence, A sequential quadratically constrained quadratic programming method of feasible directions, A reduced Hessian SQP method for inequality constrained optimization, A Fast Algorithm for Maximum Likelihood Estimation of Mixture Proportions Using Sequential Quadratic Programming, 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, Unit stepsize for the Newton method close to critical solutions, Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations, Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming, Constrained Lipschitzian error bounds and noncritical solutions of constrained equations, Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers, An active set sequential quadratic programming algorithm for nonlinear optimisation, Unnamed Item, An SQP algorithm with cautious updating criteria for nonlinear degenerate problems, Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces, Local analysis of a new multipliers method, 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
