scientific article; zbMATH DE number 1014538
From MaRDI portal
Publication:4338261
Recommendations
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- A modified SQP method with nonmonotone linesearch technique.
- An SQP method with a revised non-monotone line search
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- A new non-monotone SQP algorithm for the minimax problem
Cited in
(13)- Nonmonotone line search algorithm for constrained minimax problems
- A sequential quadratic programming algorithm with non-monotone line search
- A line search SQP-type method with bi-object strategy for nonlinear semidefinite programming
- An SQP method with a revised non-monotone line search
- Generalized monotone line search SQP algorithm for constrained minimax problems
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- Inexact sequential quadratically constrained quadratic programming methods with nonmonotone line searches for convex programming
- A modified SQP method with nonmonotone technique and its global convergence
- A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338261)
