A new QP-free algorithm for nonlinear minimax problems

MaRDI QIDQ5197091zbMATH OpenFDO

Authors Guodong Ma, Zewen Zhou, Wenhui Jin

Publication date 20 September 2019

zbMATH Keywords

global convergencenonlinear minimax problemQP-free algorithm

Mathematics Subject Classification ID

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

Recommendations

• A QP-free algorithm for finite minimax problems
• A globally convergent QP-free algorithm for inequality constrained minimax optimization
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
• A new non-monotone SQP algorithm for the minimax problem
• A new superlinearly convergent SQP algorithm for nonlinear minimax problems

Cited in

(2)

• A QP-free algorithm for finite minimax problems
• A globally convergent QP-free algorithm for inequality constrained minimax optimization

This page was built for publication: A new QP-free algorithm for nonlinear minimax problems

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