Numerical method for solving polynomial minimax problem

DOI10.13715/J.CNKI.NSJXU.2020.02.004MaRDI QIDQ5143909zbMATH OpenFDO

Authors Wenjie Zhao, Guangming Zhou

Publication date 14 January 2021

Full work available at URL https://doi.org/10.13715/J.CNKI.NSJXU.2020.02.004

zbMATH Keywords

global optimization valuepolynomial minimax problempolynomial minimization problemsemi-definite relaxation method

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35) Numerical methods of relaxation type (49M20) Minimax problems in mathematical programming (90C47)

Recommendations

• An algorithm for the global optimization of a class of continuous minimax problems
• scientific article; zbMATH DE number 1984325
• scientific article; zbMATH DE number 6703425
• scientific article; zbMATH DE number 4064388
• Solving polynomial least squares problems via semidefinite programming relaxations

Cited in

(4)

• An algorithm for the global optimization of a class of continuous minimax problems
• Solving polynomial least squares problems via semidefinite programming relaxations
• scientific article; zbMATH DE number 4064388 (Why is no real title available?)
• The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method

This page was built for publication: Numerical method for solving polynomial minimax problem

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