Faster randomized interior point methods for tall/wide linear programs
Linear programming (LP) is an extremely useful tool which has been successfully applied to
solve various problems in a wide range of areas, including operations research …
solve various problems in a wide range of areas, including operations research …
Faster randomized infeasible interior point methods for tall/wide linear programs
Linear programming (LP) is used in many machine learning applications, such as $\ell_1 $-
regularized SVMs, basis pursuit, nonnegative matrix factorization, etc. Interior Point Methods …
regularized SVMs, basis pursuit, nonnegative matrix factorization, etc. Interior Point Methods …
Speeding up linear programming using randomized linear algebra
Linear programming (LP) is an extremely useful tool and has been successfully applied to
solve various problems in a wide range of areas, including operations research …
solve various problems in a wide range of areas, including operations research …
Black-Box Acceleration of Monotone Convex Program Solvers
This paper presents a black-box framework for accelerating packing optimization solvers.
Our method applies to packing linear programming problems and a family of convex …
Our method applies to packing linear programming problems and a family of convex …
Faster Matrix Algorithms Via Randomized Sketching & Preconditioning
A Chowdhury - 2021 - search.proquest.com
Recently, in statistics and machine learning, the notion of Randomization in Numerical
Linear Algebra (RandNLA) has not only evolved as a vital new tool to design fast and …
Linear Algebra (RandNLA) has not only evolved as a vital new tool to design fast and …
Frameworks for High Dimensional Convex Optimization
PAN London - 2021 - thesis.library.caltech.edu
We present novel, efficient algorithms for solving extremely large optimization problems. A
significant bottleneck today is that as the size of datasets grow, researchers across …
significant bottleneck today is that as the size of datasets grow, researchers across …
[图书][B] Frameworks for High Dimensional Convex Optimization
PA den Nijs London - 2020 - search.proquest.com
We present novel, efficient algorithms for solving extremely large optimization problems. A
significant bottleneck today is that as the size of datasets grow, researchers across …
significant bottleneck today is that as the size of datasets grow, researchers across …