Generalized monotone line search SQP algorithm for constrained minimax problems
From MaRDI portal
Publication:3622010
DOI10.1080/02331930801951140zbMath1158.90404OpenAlexW2130570561MaRDI QIDQ3622010
Xue-Lu Zhang, Ran Quan, Qing Ma, Jin-Bao Jian
Publication date: 23 April 2009
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930801951140
global convergencesuperlinear convergenceconstrained minimax problemsSQP algorithmgeneralized monotone line search
Related Items (12)
A nonmonotonic hybrid algorithm for min-max problem ⋮ A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints ⋮ A nonlinear augmented Lagrangian for constrained minimax problems ⋮ An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints ⋮ A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ Improved filter-SQP algorithm with active set for constrained minimax problems ⋮ A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
Cites Work
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- More test examples for nonlinear programming codes
- Nonmonotone line search for minimax problems
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- Nonmonotone line search algorithm for constrained minimax problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- 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 Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A surperlinearly convergent algorithm for constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- Interior Methods for Nonlinear Optimization
This page was built for publication: Generalized monotone line search SQP algorithm for constrained minimax problems
