A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
DOI10.1186/S13660-017-1321-3zbMATH Open1358.90134OpenAlexW2592652339WikidataQ38904912 ScholiaQ38904912MaRDI QIDQ515950FDOQ515950
Authors: 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
Recommendations
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- A new generalized gradient projection method for general constrained optimization
- A strongly convergent generalized gradient projection method for minimax optimization with general constraints
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- A general regularized gradient-projection method for solving equilibrium and constrained convex minimization problems
- Publication:4870434
- scientific article; zbMATH DE number 4030852
- A generalized gradient projection algorithm of optimization with nonlinear constraints
- Generalized gradient projection algorithm for unconstrained minimax problems
- A generalized gradient projection algorithm for a mathematical program with complementarity constraints
inequality constraintsgeneralized gradient projection methodglobal and strong convergenceminimax optimization problems
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions for minimax problems (49K35)
Cites Work
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Active Set Identification in Nonlinear Programming
- On the Accurate Identification of Active Constraints
- On the Identification of Active Constraints
- Algorithms with adaptive smoothing for finite minimax problems
- An Incremental Method for Solving Convex Finite Min-Max Problems
- Smoothing method for minimax problems
- An improved SQP algorithm for solving minimax problems
- An extended multifacility minimax location problem revisited
- Superlinearly convergent algorithm for min-max problems
- Portfolio optimization under a minimax rule
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- On the accurate identification of active set for constrained minimax problems
- 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
- Generalized monotone line search SQP algorithm for constrained minimax problems
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- A truncated aggregate smoothing Newton method for minimax problems
- Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A feasible descent bundle method for inequality constrained minimax problems
- On Rosen's gradient projection methods
Cited In (6)
- Title not available (Why is that?)
- Generalized gradient projection algorithm for unconstrained minimax problems
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- Generalized project algorithm for solving unconstrained minimax problems
- A strongly convergent generalized gradient projection method for minimax optimization with general constraints
- An \(\varepsilon\)-generalized gradient projection method for nonlinear 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515950)
