A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems

DOI10.4208/jcm.2106-m2020-0059OpenAlexW4308865745MaRDI QIDQ5881251

Yufeng Zhang, Guodong Ma, Jin-Bao Jian

Publication date: 9 March 2023

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/jcm.2106-m2020-0059

zbMATH Keywords

minimax problemsinequality constraintsmethod of quasi-strongly sub-feasible directionsglobal and strong convergenceSSLE-type algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
• On solving large-scale finite minimax problems using exponential smoothing
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
• A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
• An interior-point algorithm for nonlinear minimax problems
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
• 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
• A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
• Portfolio Optimization Under a Minimax Rule
• A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
• Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A New Trust-Region Algorithm for Finite Minimax Problem

This page was built for publication: A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems