Subspace-stabilized sequential quadratic programming
From MaRDI portal
Publication:2012234
DOI10.1007/s10589-016-9890-5zbMath1375.90315OpenAlexW2568842586MaRDI QIDQ2012234
E. I. Uskov, Alexey F. Izmailov
Publication date: 28 July 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9890-5
global convergencesequential quadratic programmingsuperlinear convergencenoncritical Lagrange multiplierdual stabilizationdegenerate solution
Related Items (4)
A globally convergent regularized interior point method for constrained optimization ⋮ A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs ⋮ Convergence of a stabilized SQP method for equality constrained optimization ⋮ A globally convergent Levenberg-Marquardt method for equality-constrained optimization
Cites Work
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
- Stabilized SQP revisited
- A primal-dual augmented Lagrangian
- Attraction of Newton method to critical Lagrange multipliers: fully quadratic case
- A stabilized SQP method: superlinear convergence
- Combining stabilized SQP with the augmented Lagrangian algorithm
- On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Rejoinder on: 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
- A New Class of Augmented Lagrangians in Nonlinear Programming
- Newton-Type Methods for Optimization Problems without Constraint Qualifications
- A stabilized SQP method: global convergence
- Modifying SQP for Degenerate Problems
- Newton-Type Methods for Optimization and Variational Problems
- A Globally Convergent Stabilized SQP Method
- Global Optimization and Constraint Satisfaction
- Benchmarking optimization software with performance profiles.
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Unnamed Item
This page was built for publication: Subspace-stabilized sequential quadratic programming
