2022
DOI: 10.1007/s10107-022-01912-6
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(1 citation statement)
references
References 79 publications
0
1
0
Order By: Relevance
“…Such property is an improvement compared to other global optimization methods, such as combinatorial optimization with exponential complexity. To improve the scalability for realtime deployment, combining the global convergence property of SDP [76] and fast local search on Lie groups [77][78][79][80][81], should be considered in the future.…”
Section: Discussionmentioning
confidence: 99%
“…Such property is an improvement compared to other global optimization methods, such as combinatorial optimization with exponential complexity. To improve the scalability for realtime deployment, combining the global convergence property of SDP [76] and fast local search on Lie groups [77][78][79][80][81], should be considered in the future.…”
Section: Discussionmentioning
confidence: 99%