Algebraic degree in semidefinite and polynomial optimization
From MaRDI portal
Publication:2802519
DOI10.1007/978-1-4614-0769-0_3zbMATH Open1334.90114OpenAlexW86440575MaRDI QIDQ2802519FDOQ2802519
Authors: 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
Recommendations
Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- Numerical Optimization
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algebraic degree of semidefinite programming
- Algebraic degree of polynomial optimization
- A general formula for the algebraic degree in semidefinite programming
Cited In (12)
- Algebraic optimization degree
- The algebraic degree of semidefinite programming
- Linear optimization on varieties and Chern-Mather classes
- A characterization of the algebraic degree in semidefinite programming
- The algebraic degree of geometric optimization problems
- A lower bound on the positive semidefinite rank of convex bodies
- Algebraic degree of polynomial optimization
- On Hermitian polynomial optimization
- Rational univariate representation and its application in optimization problem
- Real root finding for low rank linear matrices
- Critical points via monodromy and local methods
- Intrinsic complexity estimates in polynomial optimization
This page was built for publication: Algebraic degree in semidefinite and polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802519)
