Algebraic Degree in Semidefinite and Polynomial Optimization

DOI10.1007/978-1-4614-0769-0_3zbMath1334.90114OpenAlexW86440575MaRDI QIDQ2802519

Kristian Ranestad

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_3

Mathematics Subject Classification ID

Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (3)

A Lower Bound on the Positive Semidefinite Rank of Convex Bodies ⋮ Real root finding for low rank linear matrices ⋮ Critical points via monodromy and local methods

Cites Work

• The algebraic degree of semidefinite programming
• A general formula for the algebraic degree in semidefinite programming
• Numerical Optimization
• Algebraic Degree of Polynomial Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic Degree in Semidefinite and Polynomial Optimization