Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
Publication:289075
DOI10.1007/S10957-016-0889-YzbMath1360.65167OpenAlexW2256780975MaRDI QIDQ289075
E. I. Uskov, Alexey F. Izmailov, Mikhail V. Solodov
Publication date: 27 May 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0889-y
algorithmglobal convergencenumerical examplessuperlinear convergenceexact penalty functionnoncritical Lagrange multiplierprimal-dual merit functionsecond-order sufficiencystabilized sequential quadratic programming
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)
Related Items (15)
Uses Software
Cites Work
- Unnamed Item
- Stabilized SQP revisited
- A primal-dual augmented Lagrangian
- On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
- A relaxed constant positive linear dependence constraint qualification and applications
- Combining stabilized SQP with the augmented Lagrangian algorithm
- On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
- Enlarging the region of convergence of Newton's method for constrained optimization
- Properties of updating methods for the multipliers in augmented Lagrangians
- 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
- 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
- An inexact restoration strategy for the globalization of the sSQP method
- A New Class of Augmented Lagrangians in Nonlinear Programming
- A Nonmonotone Line Search Technique for Newton’s Method
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Modifying SQP for Degenerate Problems
- Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
- Newton-Type Methods for Optimization and Variational Problems
- A Globally Convergent Stabilized SQP Method
- Abstract Newtonian Frameworks and Their Applications
- Global Optimization and Constraint Satisfaction
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Benchmarking optimization software with performance profiles.
This page was built for publication: Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function