A Unified Theorem on SDP Rank Reduction
From MaRDI portal
Recommendations
- Affine reductions for LPs and SDPs
- A unified approach to sufficient dimension reduction
- A nonconvex exact relaxation of the semidefinite matrix rank minimization
- scientific article; zbMATH DE number 756190
- A note on the generalized rank reduction
- A strengthened Barvinok-Pataki bound on SDP rank
- A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
- A potential reduction algorithm for an extended SDP problem
- Algorithms and Data Structures
- scientific article; zbMATH DE number 2212599
Cited in
(11)- Theorems of the alternative for inequality systems of real polynomials
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
- Jordan-algebraic aspects of optimization: randomization
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Convexity of the image of a quadratic map via the relative entropy distance
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Moment inequalities for sums of random matrices and their applications in optimization
- A Riemannian dimension-reduced second-order method with application in sensor network localization
This page was built for publication: A Unified Theorem on SDP Rank Reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169003)
