Algebraic degree in semidefinite and polynomial optimization
From MaRDI portal
Publication:2802519
Recommendations
Cites work
- scientific article; zbMATH DE number 3859276 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- A general formula for the algebraic degree in semidefinite programming
- Algebraic degree of polynomial optimization
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Numerical Optimization
- The algebraic degree of semidefinite programming
Cited in
(12)- Algebraic optimization degree
- The algebraic degree of semidefinite programming
- Linear optimization on varieties and Chern-Mather classes
- The algebraic degree of geometric optimization problems
- A characterization of the algebraic degree in semidefinite programming
- 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)