Pages that link to "Item:Q3624297"
From MaRDI portal
The following pages link to A general formula for the algebraic degree in semidefinite programming (Q3624297):
Displayed 20 items.
- Discriminants and nonnegative polynomials (Q655567) (← links)
- The algebraic degree of semidefinite programming (Q847857) (← links)
- An SOS counterexample to an inequality of symmetric functions (Q2022461) (← links)
- The leading coefficient of Lascoux polynomials (Q2099460) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- The geometry of SDP-exactness in quadratic optimization (Q2191775) (← links)
- A Morse theoretic approach to non-isolated singularities and applications to optimization (Q2229979) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- Intrinsic volumes of symmetric cones and applications in convex programming (Q2515035) (← links)
- Algebraic Degree in Semidefinite and Polynomial Optimization (Q2802519) (← links)
- Exact Algorithms for Linear Matrix Inequalities (Q2834563) (← links)
- A Lower Bound on the Positive Semidefinite Rank of Convex Bodies (Q4564016) (← links)
- Gram spectrahedra (Q4635359) (← links)
- Equations and multidegrees for inverse symmetric matrix pairs (Q5030920) (← links)
- Generic Spectrahedral Shadows (Q5259828) (← links)
- The Euclidean distance degree of an algebraic variety (Q5963081) (← links)
- The Maximum Likelihood Degree of Sparse Polynomial Systems (Q6043375) (← links)
- Nonlinear algebra and applications (Q6135318) (← links)
- A characterization of the algebraic degree in semidefinite programming (Q6157477) (← links)
- Linear optimization on varieties and Chern-Mather classes (Q6184569) (← links)