Crossmark

An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization

Crossref DOI link: https://doi.org/10.1007/s10107-022-01912-6

Published Online: 2022-11-29

Published Print: 2023-09

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

Authors

Yang, Heng

Liang, Ling https://orcid.org/0000-0003-0671-9561
Carlone, Luca

Toh, Kim-Chuan
Funding

Funding for this research was provided by:

ARL DCIST CRA (W911NF-17-2-0181)

NSF CAREER (“Certifiable Perception for Autonomous Cyber-Physical Systems”)

Ministry of Education, Singapore (MOE-2019-T3-1-010)
License Information

Text and Data Mining valid from 2022-11-29

Version of Record valid from 2022-11-29
More Information

Article History

Received: 27 October 2021

Accepted: 17 November 2022

First Online: 29 November 2022

Document is current

Any future updates will be listed below