Skip to main content
Springer Nature Link
Log in

Complexity analysis of the analytic center cutting plane method that uses multiple cuts

  • Published:
Mathematical Programming Submit manuscript

Abstract

We analyze the complexity of the analytic center cutting plane or column generation algorithm for solving general convex problems defined by a separation oracle. The oracle is called at the analytic center of a polytope, which contains a solution set and is given by the intersection of the linear inequalities previously generated from the oracle. If the center is not in the solution set, separating hyperplanes will be placed through the center to shrink the containing polytope. While the complexity result has been recently established for the algorithm when one cutting plane is placed in each iteration, the result remains open when multiple cuts are added. Moreover, adding multiple cuts actually is a key to practical effectiveness in solving many problems and it presents theoretical difficulties in analyzing cutting plane methods. In this paper, we show that the analytic center cutting plane algorithm, with multiple cuts added in each iteration, still is a fully polynomial approximation algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Altman and K.C. Kiwiel, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Systems Research Institute, Newelska 6, 01-447, Warsaw, Poland, 1994.

  2. O. Bahn, O. Du Merle, J.-L. Goffin and J.-P. Vial, A cutting plane method from the analytic centers for stochastic programming,Mathematical Programming 69 (1995) 45–74.

    MathSciNet  Google Scholar 

  3. J.-L. Goffin, Z. Luo and Y. Ye, Complexity analysis of an interior cutting plane method for convex feasibility problems,SIAM Journal on Optimization 6 (1996) 638–652.

    Article  MATH  MathSciNet  Google Scholar 

  4. Z. Luo, Analysis of a cutting plane method that uses weighted analytic center and multiple cuts, Manuscript, Department of Electrical and Computer Engineering, McMaster University, Canada, 1994.

    Google Scholar 

  5. J.E. Mitchell and M.J. Todd, Solving combinatorial optimization problems using Karmarkar’s algorithm,Mathematical Programming 56 (1992) 245–284.

    Article  MathSciNet  Google Scholar 

  6. Yu. Nesterov, Complexity estimates of some cutting plane methods based on the analytic barrier,Mathematical Programming 69 (1995) 177–204.

    MathSciNet  Google Scholar 

  7. M.W. Padberg, A different convergence proof of the projective method for linear programming,Operations Research Letters 4 (1986) 253–257.

    Article  MATH  MathSciNet  Google Scholar 

  8. G. Sonnevend, New algorithms in convex programming based on a notion of ‘centre’ (for systems of analytic inequalities) and on rational extrapolation, in: K.H. Hoffmann, J.B. Hiriat-Urruty, C. Lemarechal and J. Zowe, eds.,Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization in Irsee, West-Germany, 1986.

  9. Y. Ye, A potential reduction algorithm allowing column generation,SIAM Journal on Optimization 2 (1992) 7–20.

    Article  MATH  MathSciNet  Google Scholar 

  10. Y. Ye, A combinatorial property of the analytic center for polytopes, Manuscript, 1989.

  11. Y. Ye, An O(n 3 L) potential reduction algorithm for linear programming,Mathematical Programming 50 (1991) 239–258.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, The University of Iowa, 52242, Iowa City, IA, USA

    Yinyu Ye

Authors
  1. Yinyu Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research of the author is supported by NSF grant DDM-9207347, an Iowa Business School Summer Grant, and a University of Iowa Obermann Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ye, Y. Complexity analysis of the analytic center cutting plane method that uses multiple cuts. Mathematical Programming 78, 85–104 (1996). https://doi.org/10.1007/BF02614507

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02614507

Keywords

Search

Navigation