Abstract
Recently Goffin, Luo and Ye have analyzed the complexity of an analytic center algorithm for convex feasibility problems defined by a separation oracle. The oracle is called at the (possibly approximate) analytic center of the set given by the linear inequalities which are the previous answers of the oracle. We discuss oracles for the problem of minimizing a convex (possibly nondifferentiable) function subject to box constraints, and give corresponding complexity estimates.
Similar content being viewed by others
References
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, September 1994.
D.S. Atkinson and P.M. Vaidya, “A cutting plane algorithm for convex programming that uses analytic centers,” Math. Programming, vol. 69, pp. 1–43, 1995.
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 Appl. Math., vol. 49, pp. 3–23, 1993.
O. Bahn, O.du Merle, J.-L. Goffin, and J.-Ph. Vial, “A cutting plane method from analytic centers for stochastic programming,” Math Programming, vol. 69, pp. 45–73, 1995.
J.-L. Goffin, “Using the primal dual infeasible newton method in the analytic center method for problems defined by deep cutting planes,” Tech. Report, Faculty of Management, McGill Univ., Montreal, Quebec, September 1994.
J.-L. Goffin, A. Haurie, and J.-Ph. Vial, “Decomposition and nondifferentiable optimization with the projective algorithm,” Management Sci., vol. 37, pp. 284–302, 1992.
J.-L. Goffin, Z.-Q. Luo, and Y. Ye., “On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems,” in Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn, and P.M. Pardalos (Eds.), Kluwer: Dordrecht, 1994, pp. 182–191.
J.-L. Goffin, Z.-Q. Luo and Y. Ye, “Complexity analysis of an interior point cutting plane method for convex feasibility problems,” SIAM J. Optim. vol.? 1995, ?-?, (to appear).
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, October 1994.
K.C. Kiwiel, “Efficiency of the analytic center cutting plane method for convex minimization,” SIAM J. Optim. vol.?, 1995, (to appear).
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, September 1994.
Yu. E. Nesterov, “Complexity estimates of some cutting plane methods based on the analytical barrier,” Math. Programming, vol. 69, pp. 149–176, 1995.
A.S. Nemirovskii and D.B. Yudin, “Problem Complexity and Method Efficiency in Optimization,” Nauka, Moscow, 1979 (Russian), English transl. Wiley: New York, 1983.
G. Sonnevend, “New algorithms in convex programming based on the notion of “centre” (for systems of analytic inequalities) and on rational extrapolation,” in Trends in Mathematical Optimization, K.H. Hoffman, J.-B. Hiriart-Urruty, C. Lemaréchal, and J. Zowe (Eds.), International Series of Numerical Mathematics 84, Birkhäuser-Verlag: Basel, 1988, pp. 311–326.
S.P. Tarasov, L.G. Khachian, and I.I. Èrlikh, “The method of inscribed ellipsoids,” Dokl. Akad. Nauk SSSR vol. 298, pp. 1081–1085, 1988 (Russian), English transl. in Soviet Math. Dokl., vol. 37, pp. 226–230, 1988.
P.M. Vaidya, “A new algorithm for minimizing convex functions over convex sets,” in Proceedings 30th Annual IEEE Symposium Foundations of Computer Science, Research Triangle Park, NC, 1989, Los Alamitos, CA, 1990, IEEE Computer Society Press, pp. 338–343 (to appear in Math Programming).
Y. Ye, “A potential reduction algorithm allowing column generation,” SIAM J. Optim., vol. 2, pp. 7–20, 1992.
Y. Ye, “Complexity analysis of the analytical center cutting plane method that uses multiple cuts,” Tech. Report, Dept. of Management Sciences, Univ. of Iowa, Iowa City, IA, September 1994.
Author information
Authors and Affiliations
Additional information
The research of the first author is supported by the Polish Academy of Sciences; the research of the second author is supported by the State Committee for Scientific Research under Grant 8S50502206.
Rights and permissions
About this article
Cite this article
Altman, A., Kiwiel, K.C. A note on some analytic center cutting plane methods for convex feasibility and minimization problems. Comput Optim Applic 5, 175–180 (1996). https://doi.org/10.1007/BF00249055
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00249055