Random projections for linear programming: an improved retrieval phase

DOI10.1145/3617506MaRDI QIDQ6579780

Benedetto Manca, Leo Liberti, Pierre-Louis Poirion

Publication date: 26 July 2024

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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