Document is current

Any future updates will be listed below

On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems

Crossref DOI link: https://doi.org/10.1007/s10898-023-01353-1

Published Online: 2024-01-06

Published Print: 2024-03

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark