Complexity of some cutting plane methods that use analytic centers

Mathematical Programming, Series B

Volumn 74, Issue 1, 1996, Pages 47-54

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Analytic center; Cutting plane methods; Nondifferentiable optimization; Potential function

Indexed keywords

EID: 0041064217     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592145     Document Type: Article

References (17)

1. A. Altman and K.C. Kiwiel, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Computational Optimization and Applications 5 (1996) 175-180.
2. K.M. Anstreicher, On Vaidya's volumetric cutting plane method for convex programming, Tech. report, Dept. of Management Sciences, Univ. of Iowa, Iowa City, IA, Sept. 1994.
3. D.S. Atkinson and P.M. Vaidya, A cutting plane algorithm for convex programming that uses analytic centers, Mathematical Programming 69 (1995) 1-43.
4. O. Bahn, O. du Merle, J.-L. Goffin and J.-Ph. Vial, A cutting plane method from analytic centers for stochastic programming, Mathematical Programming 69 (1995) 45-73.
5. [51 O. Bahn, J.-L. Goffin, J.-Ph. Vial and O. du Merle, Implementation and behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Discrete Applied Mathematics 49 (1993) 3-23.
6. J.-L. Goffin, J. Gondzio, R. Sarkissian and J.-Ph. Vial, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Tech. report, Département d'économie commerciale et industrielle, Université de Genève, Genève, Switzerland, Oct. 1994.
7. J.-L. Goffin, A. Haurie and J.-Ph. Vial, Decomposition and nondifferentiable optimization with the projective algorithm, Management Science 37 (1992) 284-302.
8. J.-L. Goffin, Z.-Q. Luo and Y. Ye, On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems, in: W.W. Hager, D.W. Hearn and P.M. Pardalos, eds., Large Scale Optimization: State of the Art (Kluwer Academic Publishers, Dordrecht, 1994), 182-191.
9. J.-L. Goffin, Z.-Q. Luo and Y. Ye, Complexity analysis of an interior point cutting plane method for convex feasibility problems, SIAM Journal on Optimization (1996), to appear.
10. K.C. Kiwiel, Efficiency of the analytic center cutting plane method for convex minimization, SIAM Journal on Optimization (1996), to appear.
11. Z.-Q. Luo, Analysis of a cutting plane method that uses analytic center and multiple cuts, Tech. report, Dept. of Electrical and Computer Engineering, McMaster Univ., Hamilton, Ontario, Canada, Sept. 1994.
12. J.E. Mitchell and S. Ramaswamy, A long-step, cutting plane algorithm for linear and convex programming, DSES Technical Report No. 37-93-387, Dept. of Decision Sciences & Engg. Systems, Rensselaer Polytechnic Institute, Troy, NY, Aug. 1993; revised Aug. 1994.
13. Yu.E. Nesterov, Complexity estimates of some cutting plane methods based on the analytic barrier, Mathematical Programming 69 (1995) 149-176.
14. A.S. Nemirovskii and D.B. Yudin, Problem Complexity and Method Efficiency in Optimization (Nauka, Moscow, 1979) (in Russian); English translation: Wiley, New York, 1983.
15. G. Sonnevend, New algorithms in convex programming based on the notion of 'centre' (for systems of analytic inequalities) and on rational extrapolation, in: K.H. Hoffman, J.-B. Hiriart-Urruty, C. Lemaréchal and J. Zowe, eds., Trends in Mathematical Optimization, International Series of Numerical Mathematics 84 (Birkhäuser, Basel, 1988), 311-326.
16. Y. Ye, A potential reduction algorithm allowing column generation, SIAM Journal on Optimization 2 (1992) 7-20.
17. Y. Ye, Complexity analysis of the analytic center cutting plane method that uses multiple cuts, Tech. report, Dept. of Management Sciences, Univ. of Iowa, Iowa City, IA, Sept. 1994.