A stabilized SQP method: global convergence
From MaRDI portal
Recommendations
Cited in
(42)- A regularization method for constrained nonlinear least squares
- On the cost of solving augmented Lagrangian subproblems
- Exploiting negative curvature in deterministic and stochastic optimization
- Subspace-stabilized sequential quadratic programming
- Some theoretical limitations of second-order algorithms for smooth constrained optimization
- Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming
- A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
- scientific article; zbMATH DE number 724208 (Why is no real title available?)
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
- Stabilized SQP revisited
- A Globally Convergent Stabilized SQP Method
- Convergence to a second-order critical point by a trust-region SQP method with a nonsmooth merit function
- A globally convergent regularized interior point method for constrained optimization
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- On optimality conditions for nonlinear conic programming
- Combining stabilized SQP with the augmented Lagrangian algorithm
- A globally convergent Levenberg-Marquardt method for equality-constrained optimization
- Second-order enhanced optimality conditions and constraint qualifications
- On the Burer-Monteiro method for general semidefinite programs
- A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs
- Numerical behavior of a stabilized SQP method for degenerate NLP problems
- Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- A fast and simple modification of Newton's method avoiding saddle points
- A Note on the McCormick Second-Order Constraint Qualification
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- An adaptive stochastic sequential quadratic programming with differentiable exact augmented Lagrangians
- Primal-dual active-set methods for large-scale optimization
- A stabilized SQP method: superlinear convergence
- An inexact restoration strategy for the globalization of the sSQP method
- On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
- Global Stabilization of the Least Mean Fourth Algorithm
- A hybrid genetic algorithm-based parameter identification method for nonlinear hysteretic system with experimental verification
- Convergence of a stabilized SQP method for equality constrained optimization
- A SQP procedure for global optimization
- FarRSA for \(\ell_1\)-regularized convex optimization: local convergence and numerical experience
- Sequential quadratic optimization for nonlinear optimization problems on Riemannian manifolds
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces
This page was built for publication: A stabilized SQP method: global convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4683759)
