scientific article; zbMATH DE number 7338817

DOI10.13413/J.CNKI.JDXBLXB.2019446MaRDI QIDQ4984331zbMATH OpenFDO

Authors Yong-Liang Yang, Na Zhen, Fu-Sheng Wang

Publication date 26 April 2021

Full work available at URL https://doi.org/10.13413/J.CNKI.JDXBLXB.2019446

zbMATH Keywords

minimax problemquadratic programming algorithmnon-monotonic technique

Mathematics Subject Classification ID

Quadratic programming (90C20) Minimax problems in mathematical programming (90C47) Semi-infinite programming (90C34)

Recommendations

• A new non-monotone SQP algorithm for the minimax problem
• An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
• An approximation approach to non-strictly convex quadratic semi-infinite programming
• A strongly sub-feasible norm-relaxed SQP algorithm for finely discretized semi-infinite optimization problems
• A new superlinearly convergent SQP algorithm for nonlinear minimax problems
• scientific article; zbMATH DE number 48566
• scientific article; zbMATH DE number 6452999
• An SQP algorithm for solving semi-infinite programming problem
• A sequential quadratic programming algorithm for nonlinear minimax problems
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem

Cited in

(5)

• scientific article; zbMATH DE number 6452999 (Why is no real title available?)
• scientific article; zbMATH DE number 1186923 (Why is no real title available?)
• A non-monotone SQP algorithm with L-BFGS update for solving semi-infinite minimax problem based on active set technique
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
• A strongly sub-feasible norm-relaxed SQP algorithm for finely discretized semi-infinite optimization problems

This page was built for publication:

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