Abstract
This paper analyzes the introduction of multiple central cuts in a conic formulation of the analytic center cutting plane method (in short ACCPM). This work extends earlier work on the homogeneous ACCPM, and parallels the analysis of the multiple cut process in the standard ACCPM. The main issue is the calculation of a direction that restores feasibility after introducing p new cutting planes at the query point. We prove that the new analytic center can be recovered in O(p log ωp) damped Newton iterations, where ω is a parameter depending of the data. We also present two special cases where the complexity can be decreased to O (p log p). Finally, we show that the number of calls to the oracle is the same as in the single cut case, up to a factor \(\sqrt p \).
Similar content being viewed by others
References
O. du Merle, J.-L. Goffin, and J.-Ph. Vial, “On Improvements to the analytic center cutting plane method,” Computational Optimization and Applications, vol. 11, pp. 37–52, 1998.
J.-L. Goffin and J.-Ph. Vial, “Multiple cuts in the analytic center cutting plane method,” SIAM Journal on Optimization, vol. 11, pp. 266–288, 2000.
K.L. Jones, I.J. Lustig, J.M. Farvolden, and W.B. Powell, “Multicommodity network flows: The impact of formulation on decomposition,” Mathematical Programming, vol. 62, pp. 95–117, 1993.
Z.-Q. Luo, “Analysis of a cutting plane method that uses weighted analytic center and multiple cuts,” SIAM Journal on Optimization, vol. 4, pp. 697–716, 1994.
A. Nemirovsky and D. Yudin, Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems, J. Wiley & Sons: New York, 1983.
Yu. Nesterov, “Introductory lectures on convex optimization,” Unpublished manuscript, Louvain, Belgium, 1996.
Yu. Nesterov and A. Nemirovsky, Interior Point Polynomial Algorithms in Convex Programming: Theory and Applications, SIAM: Philadelphia, 1994.
Yu. Nesterov, O. Péton, and J.-Ph. Vial, “Homogeneous analytic center cutting plane methods with approximate centers,” Optimization methods and software, vol. 11/12, pp. 243–73, 1999.
Yu. Nesterov and J.-Ph. Vial, “Homogeneous analytic center cutting plane methods for convex problems and variational inequalities,” SIAM Journal on Optimization, vol. 9, pp. 707–728, 1999.
Yu. Nesterov and J.-Ph. Vial, “Augmented self-concordant barriers and nonlinear optimization problems with finite complexity,” Logilab Technical Report, University of Geneva, Switzerland, 2000.
Y. Ye, “Complexity analysis of the analytic center cutting plane method that uses multiple cuts,” Mathematical Programming, vol. 78, pp. 85–104, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Péton, O., Vial, JP. Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method. Computational Optimization and Applications 24, 37–61 (2003). https://doi.org/10.1023/A:1021845931805
Issue Date:
DOI: https://doi.org/10.1023/A:1021845931805