Random projections for semidefinite programming
From MaRDI portal
Recommendations
Cites work
- An Interior-Point Method for Semidefinite Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Distance geometry and data science
- Euclidean distance geometry and applications
- Extensions of Lipschitz mappings into a Hilbert space
- Functional Operators (AM-21), Volume 1
- Global optimization using random embeddings
- Inequalities for the trace of matrix product
- Mathematical programming formulations for the alternating current optimal power flow problem
- Multidimensional scaling.
- On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones
- On copositive programming and standard quadratic optimization problems
- Random projections for conic programs
- Random projections for linear programming
- Random projections for quadratic programs
- Randomized Sketches of Convex Programs With Sharp Guarantees
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Sparser Johnson-Lindenstrauss transforms
- The Johnson-Lindenstrauss Transform: An Empirical Study
This page was built for publication: Random projections for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619767)