Solving LP using random projections

DOI10.1016/J.ENDM.2016.10.014MaRDI QIDQ510927zbMATH OpenOpenAlexFDO

Authors Leo Liberti, Pierre-Louis Poirion, Vu Khac Ky

Publication date 14 February 2017

Full work available at URL https://doi.org/10.1016/j.endm.2016.10.014

zbMATH Keywords

random projectionJohnson-Lindenstrauss lemma

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Random projections for linear programming
• Random projections for quadratic programs
• Random projections of linear and semidefinite problems with linear inequalities
• Random projections for conic programs
• A randomized algorithm for fixed-dimensional linear programming
• An alternating projections algorithm for solving linear programs
• Random projections for the nonnegative least-squares problem
• scientific article; zbMATH DE number 4211801
• scientific article; zbMATH DE number 89065
• Projection algorithms for linear programming

Cites work

• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Extensions of Lipschitz mappings into a Hilbert space
• Nearest-neighbor-preserving embeddings

Cited in

(5)

• Random projections for linear programming
• Random projections for conic programs
• Random projections for quadratic programs
• Gaussian random projections for Euclidean membership problems
• Random projections of linear and semidefinite problems with linear inequalities

Describes a project that uses

Uses Software

• Netlib

This page was built for publication: Solving LP using random projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510927)