A randomized cutting plane scheme for convex optimization

In this paper we consider the basic problem of minimizing a linear function over a convex set in an n-dimensional space. We present a randomized scheme based on an interior-point cutting plane (CP) algorithm. First, a formal analysis of the proposed method is carried out under the abstract assumption on the availability of a Uniform Generation Oracle. Under this assumption, a rigorous result is presented showing that the proposed algorithm has an expected rate of convergence that improves upon existing CP methods based on center of gravity. The practical implementation of the method using an hit and run generator is discussed in the second part of the paper.

[1]  R. Tempo,et al.  Randomized Algorithms for Analysis and Control of Uncertain Systems , 2004 .

[2]  B. Grünbaum.  Partitions of mass-distributions and of convex bodies by hyperplanes. , 1960 .

[3]  M. Simonovits,et al.  Random walks and an O * ( n 5 ) volume algorithm for convex bodies , 1997 .

[4]  László Lovász,et al.  Hit-and-run mixes fast , 1999, Math. Program..

[5]  D. J. Newman,et al.  Location of the Maximum on Unimodal Surfaces , 1965, JACM.

[6]  S. Vempala,et al.  Hit-and-Run from a Corner , 2006 .

[7]  Boris T. Polyak,et al.  Hit-and-Run: new design technique for stabilization, robustness and optimization of linear systems , 2008 .

[8]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[9]  Robert L. Smith,et al.  Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions , 1984, Oper. Res..

[10]  Miklós Simonovits,et al.  Random walks and an O*(n5) volume algorithm for convex bodies , 1997, Random Struct. Algorithms.

[11]  Andreas Griewank,et al.  On constrained optimization by adjoint based quasi-Newton methods , 2002, Optim. Methods Softw..

[12]  Santosh S. Vempala,et al.  Solving convex programs by random walks , 2002, STOC '02.

[13]  S. Vempala.  Geometric Random Walks: a Survey , 2007 .

[14]  Horst Alzer,et al.  Some beta-function inequalities , 2003, Proceedings of the Royal Society of Edinburgh: Section A Mathematics.

[15]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[16]  N. Z. Shor.  Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

[17]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[18]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[19]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[20]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[21]  V. V. Buldygin,et al.  Brunn-Minkowski inequality , 2000 .

[22]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[23]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .