Generalized project algorithm for solving unconstrained minimax problems

MaRDI QIDQ5371681zbMATH OpenFDO

Authors Cong Zhang, Limin Sun, Zhibin Zhu

Publication date 20 October 2017

zbMATH Keywords

global convergenceunconstrained minimax problemsgeneralized gradient project

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Existence of solutions for minimax problems (49J35)

Recommendations

• Generalized gradient projection algorithm for unconstrained minimax problems
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
• A strongly convergent generalized gradient projection method for minimax optimization with general constraints
• Generalized monotone line search SQP algorithm for constrained minimax problems
• A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints

Cited in

(2)

• Generalized gradient projection algorithm for unconstrained minimax problems
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems

This page was built for publication: Generalized project algorithm for solving unconstrained minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371681)