Random projections for linear programming: an improved retrieval phase
From MaRDI portal
Publication:6579780
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 3230744 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A new projection method for finding the closest point in the intersection of convex sets
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An Algorithm for Restricted Least Squares Regression
- An introduction to formally real Jordan algebras and their applications in optimization
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Decoding by Linear Programming
- Dimensionality reduction of SDPs through sketching
- Dimensionality reduction with subgaussian matrices: a unified theory
- Distance geometry and data science
- Extensions of Lipschitz mappings into a Hilbert space
- Functional Operators (AM-22), Volume 2
- Gaussian random projections for Euclidean membership problems
- Global optimization using random embeddings
- High-dimensional probability. An introduction with applications in data science
- Implementing the Simplex Method: The Initial Basis
- Living on the edge: phase transitions in convex programs with random data
- Measure concentration in optimization
- Nearest-neighbor-preserving embeddings
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- On the distortion required for embedding finite metric spaces into normed spaces
- On variants of the Johnson–Lindenstrauss lemma
- Optimal Approximate Matrix Product in Terms of Stable Rank
- Parallelizing the dual revised simplex method
- Practical sketching algorithms for low-rank matrix approximation
- Proximal splitting methods in signal processing
- Quantile regression for large-scale applications
- Random projections for conic programs
- Random projections for linear programming
- Random projections for quadratic programs
- Random projections for quadratic programs over a Euclidean ball
- Random projections of linear and semidefinite problems with linear inequalities
- Randomized Sketches of Convex Programs With Sharp Guarantees
- Randomized numerical linear algebra: Foundations and algorithms
- Reformulations in Mathematical Programming: Definitions and Systematics
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Sketching as a tool for numerical linear algebra
- Sparser Johnson-Lindenstrauss transforms
- Sub-sampled Newton methods
- The Johnson-Lindenstrauss Transform: An Empirical Study
- The mathematics of signal processing
- The rate of convergence for the method of alternating projections. II
- Turán's triangle theorem and binary matroids
This page was built for publication: Random projections for linear programming: an improved retrieval phase
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579780)
