Switching stepsize strategies for sequential quadratic programming
From MaRDI portal
Recommendations
Cites work
- A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
- A globally convergent method for nonlinear programming
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A surperlinearly convergent algorithm for constrained optimization problems
- Algorithms for nonlinear constraints that use lagrangian functions
- An Exact Potential Method for Constrained Maxima
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Convergent stepsizes for constrained optimization algorithms
- Encyclopedia of optimization. In 6 vols.
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- Handbook of applied optimization
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3736490 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 724208 (Why is no real title available?)
- scientific article; zbMATH DE number 1069182 (Why is no real title available?)
- Nonlinear programming without a penalty function.
- Numerical Optimization
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Steering exact penalty methods for nonlinear programming
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Switching stepsize strategies for sequential quadratic programming
- Test examples for nonlinear programming codes
- The watchdog technique for forcing convergence in algorithms for constrained optimization
Cited in
(5)- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems
- The Sequential Quadratic Programming Method
- Switching stepsize strategies for sequential quadratic programming
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
- An interior-point algorithm for nonlinear minimax problems
This page was built for publication: Switching stepsize strategies for sequential quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635801)
