A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints

DOI10.1186/s13660-017-1321-3zbMath1358.90134OpenAlexW2592652339WikidataQ38904912 ScholiaQ38904912MaRDI QIDQ515950

Guodong Ma, Yufeng Zhang, Meixing Liu

Publication date: 17 March 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-017-1321-3

zbMATH Keywords

inequality constraintsgeneralized gradient projection methodglobal and strong convergenceminimax optimization problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35)

Cites Work

• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
• On the accurate identification of active set for constrained minimax problems
• Algorithms with adaptive smoothing for finite minimax problems
• On Rosen's gradient projection methods
• A smoothing trust-region Newton-CG method for minimax problem
• An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
• An interior-point algorithm for nonlinear minimax problems
• A truncated aggregate smoothing Newton method for minimax problems
• An improved SQP algorithm for solving minimax problems
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
• An extended multifacility minimax location problem revisited
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
• Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
• Superlinearly convergent algorithm for min-max problems
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
• An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
• Portfolio Optimization Under a Minimax Rule
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Active Set Identification in Nonlinear Programming
• Generalized monotone line search SQP algorithm for constrained minimax problems
• On the Identification of Active Constraints
• A bundle type approach to the unconstrained minimization of convex nonsmooth functions
• On the Accurate Identification of Active Constraints
• An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
• A feasible descent bundle method for inequality constrained Minimax problems
• An Incremental Method for Solving Convex Finite Min-Max Problems
• Smoothing method for minimax problems

This page was built for publication: A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints