5 citations · 8 across the 4 of their papers we have counts for
4 papers
Random projections for linear programming
Ky Vu, Pierre-Louis Poirion, Leo Liberti
Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves a…
Random projections for trust region subproblems
Ky Vu, Pierre-Louis Poirion, Claudia D'Ambrosio +1
The trust region method is an algorithm traditionally used in the field of derivative free optimization. The method works by iteratively constructing surrogate models (often linear…
New error measures and methods for realizing protein graphs from distance data
Claudia D'Ambrosio, Ky Vu, Carlile Lavor +2
The interval Distance Geometry Problem (iDGP) consists in finding a realization in of a simple undirected graph with nonnegative intervals assigned to the…
Using the Johnson-Lindenstrauss lemma in linear and integer programming
Ky Vu, Pierre-Louis Poirion, Leo Liberti
The Johnson-Lindenstrauss lemma allows dimension reduction on real vectors with low distortion on their pairwise Euclidean distances. This result is often used in algorithms such a…