Generalized gradient projection algorithm for unconstrained minimax problems

MaRDI QIDQ4980507zbMATH OpenFDO

Authors Fei Tang, Jinbao Jian, Jian-Ling Li, Chun-Ming Tang

Publication date 30 June 2014

zbMATH Keywords

generalized gradient projection algorithmglobal convergencestrong convergenceunconstrained minimax problems

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Recommendations

• Generalized project algorithm for solving 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
• A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
• Generalized monotone line search SQP algorithm for constrained minimax problems

Cited in

(4)

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

This page was built for publication: Generalized gradient projection algorithm for unconstrained minimax problems

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