Random projections for linear programming: an improved retrieval phase
From MaRDI portal
Publication:6579780
DOI10.1145/3617506MaRDI QIDQ6579780FDOQ6579780
Authors: Leo Liberti, Benedetto Manca, Pierre-Louis Poirion
Publication date: 26 July 2024
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- The rate of convergence for the method of alternating projections. II
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Extensions of Lipschitz mappings into a Hilbert space
- High-Dimensional Probability
- Decoding by Linear Programming
- The fast Cauchy transform and faster robust linear regression
- The Johnson-Lindenstrauss Transform: An Empirical Study
- Proximal splitting methods in signal processing
- Title not available (Why is that?)
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Implementing the Simplex Method: The Initial Basis
- Title not available (Why is that?)
- Dimensionality reduction with subgaussian matrices: a unified theory
- Functional Operators (AM-22), Volume 2
- An Algorithm for Restricted Least Squares Regression
- Living on the edge: phase transitions in convex programs with random data
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- On variants of the Johnson–Lindenstrauss lemma
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Reformulations in Mathematical Programming: Definitions and Systematics
- Randomized numerical linear algebra: Foundations and algorithms
- Nearest-neighbor-preserving embeddings
- Parallelizing the dual revised simplex method
- Randomized Sketches of Convex Programs With Sharp Guarantees
- Sparser Johnson-Lindenstrauss Transforms
- Random projections for conic programs
- Random projections for quadratic programs
- Random projections of linear and semidefinite problems with linear inequalities
- Random Projections for Linear Programming
- On the distortion required for embedding finite metric spaces into normed spaces
- Measure concentration in optimization
- A new projection method for finding the closest point in the intersection of convex sets
- Distance geometry and data science
- Computational Advertising: Techniques for Targeting Relevant Ads
- Turán's triangle theorem and binary matroids
- Quantile Regression for Large-Scale Applications
- The mathematics of signal processing
- Gaussian random projections for Euclidean membership problems
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization
- Dimensionality reduction of SDPs through sketching
- Sub-sampled Newton methods
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Optimal Approximate Matrix Product in Terms of Stable Rank
- Random projections for quadratic programs over a Euclidean ball
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Global optimization using random embeddings
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)