Complexity of some cutting plane methods that use analytic centers

We consider cutting plane methods for minimizing a convex (possibly nondifferentiable) function subject to box constraints. At each iteration, accumulated subgradient cuts define a polytope that localizes the minimum. The objective and its subgradient are evaluated at the analytic center of this polytope to produce one or two cuts that improve the localizing set. We give complexity estimates for several variants of such methods. Our analysis is based on the works of Goffin, Luo and Ye.

[1]  Y. Ye,et al.  On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Feasibility Problems , 1994 .

[2]  Kurt M. Anstreicher.  On Vaidya's Volumetric Cutting Plane Method for Convex Programming , 1997, Math. Oper. Res..

[3]  Jean-Philippe Vial,et al.  A cutting plane method from analytic centers for stochastic programming , 1995, Math. Program..

[4]  Jacek Gondzio,et al.  Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..

[5]  G. Sonnevend.  New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation , 1988 .

[6]  Yinyu Ye,et al.  Complexity analysis of the analytic center cutting plane method that uses multiple cuts , 1997, Math. Program..

[7]  Pravin M. Vaidya,et al.  A cutting plane algorithm for convex programming that uses analytic centers , 1995, Math. Program..

[8]  John Darzentas,et al.  Problem Complexity and Method Efficiency in Optimization , 1983 .

[9]  Yurii Nesterov,et al.  Complexity estimates of some cutting plane methods based on the analytic barrier , 1995, Math. Program..

[10]  Yinyu Ye,et al.  Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems , 1996, SIAM J. Optim..

[11]  J. Goffin,et al.  Decomposition and nondifferentiable optimization with the projective algorithm , 1992 .

[12]  Jean-Philippe Vial,et al.  Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming , 1994, Discret. Appl. Math..

[13]  Krzysztof C. Kiwiel,et al.  Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization , 1997, SIAM J. Optim..

[14]  Yinyu Ye,et al.  A Potential Reduction Algorithm Allowing Column Generation , 1992, SIAM J. Optim..

[15]  Krzysztof C. Kiwiel,et al.  A note on some analytic center cutting plane methods for convex feasibility and minimization problems , 1996, Comput. Optim. Appl..