Sparse convex relaxations in polynomial optimization
From MaRDI portal
Publication:6524827
zbMatharXiv:2403.03560MaRDI QIDQ6524827
Benjamin Peters, Sebastian Sager, Gennadiy Averkov
Publication date: 1 January 1
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Real algebra (13J30) Polynomial optimization (90C23)
This page was built for publication: Sparse convex relaxations in polynomial optimization