On time complexity of semidefinite programs arising in polynomial optimization

MaRDI QIDQ2966411zbMATH OpenFDO

Authors Igor Klep, Janez Povh, Angelika Wiegele

Publication date 7 March 2017

Mathematics Subject Classification ID

Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Semialgebraic sets and related spaces (14P10)

Recommendations

• On the complexity of semidefinite programs
• Time-Varying Semidefinite Programs
• Polynomial time solvability of non-symmetric semidefinite programming
• Semidefinite programming
• Semidefinite Programming

Cited in

(5)

• Time-Varying Semidefinite Programs
• On the complexity of semidefinite programs
• The complexity of semilinear problems in succinct representation
• Polynomial time solvability of non-symmetric semidefinite programming
• A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization

This page was built for publication: On time complexity of semidefinite programs arising in polynomial optimization

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