Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees

MaRDI QIDQ7218220arXivFDO

Authors Sarah Yini Gao, Xindong Tang, Yancheng Yuan

Publication date 2026

Published in arXiv

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Moment problems (44A60) Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Polynomial optimization (90C23)

arXiv classification

math.OC

This page was built for publication: Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees

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