Complexity analysis of an interior cutting plane method for convex feasibility problems

Jean Louis Goffin, Zhi Quan Luo, Yinyu Ye

Research output: Contribution to journalArticlepeer-review

92 Scopus citations

Abstract

We further analyze the convergence and the complexity of a dual column generation algorithm for solving general convex feasibility problems defined by a separation oracle. The oracle is called at an approximate analytic center of the set given by the intersection of the linear inequalities which are the previous answers of the oracle. We show that the algorithm converges in finite time and is in fact a fully polynomial approximation algorithm, provided that the feasible region has a nonempty interior.

Original languageEnglish (US)
Pages (from-to)638-652
Number of pages15
JournalSIAM Journal on Optimization
Volume6
Issue number3
DOIs
StatePublished - Aug 1996

Keywords

  • Column generation
  • Convex feasibility problem
  • Cutting planes
  • Potential reduction

Fingerprint

Dive into the research topics of 'Complexity analysis of an interior cutting plane method for convex feasibility problems'. Together they form a unique fingerprint.

Cite this