Generalized monotone line search SQP algorithm for constrained minimax problems
From MaRDI portal
Publication:3622010
Recommendations
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- scientific article; zbMATH DE number 1014538
- Generalised monotone line search algorithm for degenerate nonlinear minimax problems
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- Nonmonotone line search algorithm for constrained minimax problems
- An SQP method with a revised non-monotone line search
- A new non-monotone SQP algorithm for the minimax problem
- A sequential quadratic programming algorithm with non-monotone line search
- A norm-relaxed SQP algorithm with a system of linear equations for constrained minimax problems
- A modified SQP algorithm for minimax problems
Cites work
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A surperlinearly convergent algorithm for constrained optimization problems
- Interior Methods for Nonlinear Optimization
- More test examples for nonlinear programming codes
- Nonmonotone line search algorithm for constrained minimax problems
- Nonmonotone line search for minimax problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited in
(20)- Nonmonotone line search algorithm for constrained minimax problems
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- scientific article; zbMATH DE number 465332 (Why is no real title available?)
- A proximal-projection partial bundle method for convex constrained minimax problems
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- Nonmonotone algorithm for minimax optimization problems
- Generalized gradient projection algorithm for unconstrained minimax problems
- A hybrid algorithm for linearly 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
- Generalised monotone line search algorithm for degenerate nonlinear minimax problems
- Improved filter-SQP algorithm with active set for constrained minimax problems
- A nonmonotonic hybrid algorithm for min-max problem
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- A nonlinear augmented Lagrangian for constrained minimax problems
- An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems
- Generalized project algorithm for solving unconstrained minimax problems
This page was built for publication: Generalized monotone line search SQP algorithm for constrained minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3622010)