Solving convex programs by random walks

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 109-115

  Bertsimas, Dimitris ^a   Vempala, Santosh ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

CONVEX PROGRAMS; RANDOM WALKS;

RANDOM PROCESSES;

EID: 0036036824     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509923.509926     Document Type: Conference Paper

References (22)

1. Random points in isotropic convex sets
2. A random polynomial time algorithm for estimating the volumes of convex bodies
3. The ellipsoid method and its consequences in combinatorial optimization
4. Partitions of mass-distributions and convex bodies by hyperplanes
5. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
6. Efficient algorithms for universal portfolios
7. Faster mixing via average conductance
8. Isoperimetric problems for convex bodies and a localization lemma
9. 5) volume algorithm for convex sets
10. A randomized algorithm to optimize over certain convex sets
11. On linear characterization of combinatorial optimization problems
12. A polynomial algorithm in linear programming
13. On an algorithm for the minimization of convex functions
14. Hit-and-run mixes fast
15. Random walks in convex bodies and an improved volume algorithm
16. The Russian method for linear programming III: Bounded integer programming
17. On logarithmic concave measures and functions
18. Random vectors in the isotropic position
19. A new algorithm for minimizing convex functions over convex sets
20. Evaluation of the information complexity of mathematical programming problems