Sparse sub-Gaussian random projections for semidefinite programming relaxations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1534299 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A bounded degree SOS hierarchy for polynomial optimization
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Accelerated first-order methods for hyperbolic programming
- Approximation of the joint spectral radius using sum of squares
- Conic optimization via operator splitting and homogeneous self-dual embedding
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Dimensionality reduction of SDPs through sketching
- Dimensionality reduction with subgaussian matrices: a unified theory
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Extensions of Lipschitz mappings into a Hilbert space
- Global optimization with polynomials and the problem of moments
- High-dimensional probability. An introduction with applications in data science
- Local minima and convergence in low-rank semidefinite programming
- Low-Rank PSD Approximation in Input-Sparsity Time
- Low-rank optimization on the cone of positive semidefinite matrices
- Nearest-neighbor-preserving embeddings
- On semidefinite programming relaxations of \((2+p)\)-SAT
- On variants of the Johnson–Lindenstrauss lemma
- Positive polynomials in control.
- Practical sketching algorithms for low-rank matrix approximation
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Random projections for conic programs
- Random projections for linear programming
- Random projections for quadratic programs
- Random projections for semidefinite programming
- Random projections of linear and semidefinite problems with linear inequalities
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Relaxations of the satisfiability problem using semidefinite programming
- Scalable Design of Structured Controllers Using Chordal Decomposition
- Scalable semidefinite programming
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming relaxations for semialgebraic problems
- Sums of squares, moment matrices and optimization over polynomials
- Symmetry groups, semidefinite programs, and sums of squares
- Symmetry in semidefinite programs
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
This page was built for publication: Sparse sub-Gaussian random projections for semidefinite programming relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892808)
