A sequential quadratic programming algorithm with non-monotone line search
From MaRDI portal
Recommendations
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- scientific article; zbMATH DE number 1014538
- An SQP method with a revised non-monotone line search
- A sequential quadratic programming algorithm for nonlinear minimax problems
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
Cited in
(10)- Optimal production schedule in a single-supplier multi-manufacturer supply chain involving time delays in both levels
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Generalized monotone line search SQP algorithm for constrained minimax problems
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration
- A gradient-based approach for optimal actuator design with morphing wings
- Direct differentiation of the floating frame of reference formulation via invariants for gradient-based design optimization
- A penalty-free method with nonmonotone line search for nonlinear optimization
- An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
This page was built for publication: A sequential quadratic programming algorithm with non-monotone line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517228)
