An inexact restoration strategy for the globalization of the sSQP method
From MaRDI portal
Publication:2377163
DOI10.1007/s10589-012-9502-yzbMath1295.90077OpenAlexW2019894644MaRDI QIDQ2377163
Publication date: 28 June 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9502-y
Related Items
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ Inexact restoration for derivative-free expensive function minimization and applications ⋮ Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function ⋮ A globally convergent regularized interior point method for constrained optimization ⋮ On the sensitivity of a Euclidean projection ⋮ Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework ⋮ Combining stabilized SQP with the augmented Lagrangian algorithm ⋮ Convergence of a stabilized SQP method for equality constrained optimization ⋮ On the cost of solving augmented Lagrangian subproblems ⋮ A regularization method for constrained nonlinear least squares ⋮ A globally convergent Levenberg-Marquardt method for equality-constrained optimization ⋮ A Regularized Factorization-Free Method for Equality-Constrained Optimization ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ Newton-type methods: a broader view ⋮ Subspace-stabilized sequential quadratic programming ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- Stabilized SQP revisited
- Local convergence of an inexact-restoration method and numerical experiments
- A new line search inexact restoration approach for nonlinear programming
- Multiplier methods: A survey
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Inexact-restoration algorithm for constrained optimization
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Multiplier and gradient methods
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- On the Convergence of Augmented Lagrangian Methods for Constrained Global Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Numerical Optimization
- Modifying SQP for Degenerate Problems
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- The method of penalty estimates for conditional extremum problems
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
This page was built for publication: An inexact restoration strategy for the globalization of the sSQP method
