A discretization method for a class of copositive programming problems

DOI10.61208/PJO-2023-022MaRDI QIDQ6664306zbMATH OpenFDO

Authors Chuanhao Guo, Peng-Fei Ma, Kok Lay Teo

Publication date 16 January 2025

Published in Pacific Journal of Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.61208/PJO-2023-022

zbMATH Keywords

copositive programmingdiscretization methodfinite convergencesemi-infinite programming

Mathematics Subject Classification ID

Discrete approximations in optimal control (49M25) Nonconvex programming, global optimization (90C26) Semi-infinite programming (90C34) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Copositive programming via semi-infinite optimization
• Quadratic factorization heuristics for copositive programming
• Copositive programming by simplicial partition
• Copositive programming
• Discretization methods for the solution of semi-infinite programming problems

This page was built for publication: A discretization method for a class of copositive programming problems

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