An effective linearizing method for the specific nonlinear minimax optimization problem

MaRDI QIDQ4627361zbMATH OpenFDO

Authors Mio Horai, Takashi Gyoshin Nitta

Publication date 7 March 2019

zbMATH Keywords

branch and bound algorithmlinearized methodnonlinear minimax optimization

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Nonlinear programming (90C30)

Recommendations

• A linearized relaxing algorithm for the specific nonlinear optimization problem
• A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
• A direct method of linearization for continuous minimax problems
• Solution of minimax problems using equivalent differentiable functions
• scientific article; zbMATH DE number 939066

Cited in

(3)

• An efficient approach to nonlinear minimax problems
• A linearized relaxing algorithm for the specific nonlinear optimization problem
• scientific article; zbMATH DE number 3289897 (Why is no real title available?)

This page was built for publication: An effective linearizing method for the specific nonlinear minimax optimization problem

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