Random projections for conic programs
From MaRDI portal
Publication:2040548
Abstract: We discuss the application of random projections to conic programming: notably linear, second-order and semidefinite programs. We prove general approximation results on feasibility and optimality using the framework of formally real Jordan algebras. We then discuss some computational experiments on randomly generated semidefinite programs in order to illustrate the practical applicability of our ideas
Recommendations
Cites work
- An introduction to formally real Jordan algebras and their applications in optimization
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Dimensionality reduction of SDPs through sketching
- Dimensionality reduction with subgaussian matrices: a unified theory
- Extensions of Lipschitz mappings into a Hilbert space
- Gaussian random projections for Euclidean membership problems
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- Low-Rank PSD Approximation in Input-Sparsity Time
- Nearest-neighbor-preserving embeddings
- Practical sketching algorithms for low-rank matrix approximation
- Random projections for linear programming
- Random projections for quadratic programs
- Random projections for quadratic programs over a Euclidean ball
- Sparser Johnson-Lindenstrauss transforms
Cited in
(15)- Conditioning of random conic systems under a general family of input distributions
- Random projections for the nonnegative least-squares problem
- Random projections for quadratic programs
- Normal projection: deterministic and probabilistic algorithms
- Random projections for quadratic programs over a Euclidean ball
- Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings
- Random projections of linear and semidefinite problems with linear inequalities
- Convexification with bounded gap for randomly projected quadratic optimization
- Solving LP using random projections
- Random projections for linear programming
- Global optimization using random embeddings
- Random projections for linear programming: an improved retrieval phase
- Random projections for semidefinite programming
- Sparse sub-Gaussian random projections for semidefinite programming relaxations
- Scalable approximate optimal diagonal preconditioning
This page was built for publication: Random projections for conic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040548)
