Pages that link to "Item:Q3169003"
From MaRDI portal
The following pages link to A Unified Theorem on SDP Rank Reduction (Q3169003):
Displaying 10 items.
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Convexity of the image of a quadratic map via the relative entropy distance (Q464812) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653) (← links)
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908) (← links)
- Moment inequalities for sums of random matrices and their applications in optimization (Q647387) (← links)
- Theorems of the alternative for inequality systems of real polynomials (Q1762405) (← links)
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- Jordan-algebraic aspects of optimization: randomization (Q3161141) (← links)
