Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
From MaRDI portal
Publication:481052
DOI10.1007/s10957-013-0503-5zbMath1309.90122OpenAlexW2143895442MaRDI QIDQ481052
Jin-Bao Jian, Chun-Ming Tang, Qing-Juan Hu
Publication date: 12 December 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0503-5
Minimax problems in mathematical programming (90C47) Methods of successive quadratic programming type (90C55)
Related Items
A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A hybrid algorithm for linearly constrained minimax problems
- On the accurate identification of active set for constrained minimax problems
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- A new norm-relaxed SQP algorithm with global convergence
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- An improved SQP algorithm for solving minimax problems
- A cutting plane method for solving minimax problems in the complex plane
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- A generalization of the norm-relaxed method of feasible directions
- Nonmonotone line search for minimax problems
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- Nonmonotone line search algorithm for constrained minimax problems
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- Hyperbolic smoothing function method for minimax problems
- Generalized monotone line search SQP algorithm for constrained minimax problems
- On the Identification of Active Constraints
- On the Accurate Identification of Active Constraints
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Rate of Convergence of a Class of Methods of Feasible Directions
- Derivative-free optimization methods for finite minimax problems
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- A superlinearly convergent method of feasible directions.
- Smoothing method for minimax problems
