scientific article; zbMATH DE number 1534291
From MaRDI portal
Publication:4517100
Cited in
(12)- Multiobjective duality for convex semidefinite programming problems
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position
- Numerical algebraic geometry and semidefinite programming
- On the behavior of the homogeneous self-dual model for conic convex optimization
- Noncommutative polynomials nonnegative on a variety intersect a convex set
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets
- Solving SDP completely with an interior point oracle
- Refining the partition for multifold conic optimization problems
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Strong duality in lasserre's hierarchy for polynomial optimization
- Complexity of chordal conversion for sparse semidefinite programs with small treewidth
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517100)
