A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio |
| |
Authors: | Ilan Adler Ron Shamir |
| |
Institution: | (1) Industrial Engineering and Operations Research Department, University of California, Berkeley, CA, USA;(2) School of Mathematical Sciences, Sackler Faculty of Exact Sciences, Tel-Aviv University, Tel-Aviv, Israel;(3) Department of Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel-Aviv University, 69978 Ramat-Aviv, Tel-Aviv, Israel |
| |
Abstract: | We extend Clarkson's randomized algorithm for linear programming to a general scheme for solving convex optimization problems. The scheme can be used to speed up existing algorithms on problems which have many more constraints than variables. In particular, we give a randomized algorithm for solving convex quadratic and linear programs, which uses that scheme together with a variant of Karmarkar's interior point method. For problems withn constraints,d variables, and input lengthL, ifn = (d
2), the expected total number of major Karmarkar's iterations is O(d
2(logn)L), compared to the best known deterministic bound of O(
L). We also present several other results which follow from the general scheme. |
| |
Keywords: | Linear programming quadratic programming convex programming randomized algorithms fixed dimension optimization problems complexity |
本文献已被 SpringerLink 等数据库收录! |
|