Abstract
The convergence and complexity of a primal–dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasibility problems defined by a deep cut separation oracle is studied. The primal–dual–infeasible Newton method is used to generate a primal–dual updating direction. The number of recentering steps is O(1) for cuts as deep as half way to the deepest cut, where the deepest cut is tangent to the primal–dual variant of Dikin's ellipsoid.
Similar content being viewed by others
References
Levin, A., An Algorithm of Minimization of Convex Functions, Soviet Mathematics Doklady, Vol. 160, pp. 1244–1247, 1965.
Elzinga, J., and Moore, T., A Central Cutting Plane Algorithm for Convex Programming, Mathematical Programming, Vol. 8, pp. 134–145, 1975.
Nemirovsky, A., and Yudin, D., Problem Complexity and Method Efficiency in Optimization, Wiley-Interscience, New York, New York, 1983.
Khachiyan, L. G., Polynomial Algorithms in Linear Programming, USSR Computational Mathematics and Mathematical Physics, Vol. 20, pp. 53–72, 1980.
Tarasov, S., Khachiyan, L. G., and Erlich, I., The Method of Inscribed Ellipsoids, Soviet Mathematics Doklady, Vol. 37, pp. 835–843, 1988.
Khachiyan, L. G., and Todd, M. J., On the Complexity of Approximating the Maximal Inscribed Ellipsoid for a Polytope, Mathematical Programming, Vol. 61, pp. 137–160, 1993.
Vaidya, P., A New Algorithm for Minimizing Convex Functions over Convex Sets, Mathematical Programming, Vol. 73, pp. 291–341, 1996.
Sonnevend, G., New Algorithms in Convex Programming Based on a Notion of Center (for Systems of Analytic Inequalities) and on Rational Extrapolation, Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization, Irsee, Germany, 1986, Edited by K. H. Hoffmann, J. B. Hiriart-Urruty, C. Lemarechal, and J. Zowe, Birkhäuser Verlag, Basel, Switzerland, Vol. 84, pp. 311–327, 1988.
Goffin, J. L., Haurie, A., and Vial, J. P., Decomposition and Nondifferentiable Optimization with the Projective Algorithm, Management Science, Vol. 38, pp. 284–302, 1992.
Ye, Y., A Potential Reduction Algorithm Allowing Column Generation, SIAM Journal on Optimization, Vol. 2, pp. 7–20, 1992.
Nesterov, Y., Cutting Plane Algorithms from Analytic Centers: Efficiency Estimates, Mathematical Programming, Vol. 69, pp. 149–176, 1995.
Atkinson, D. S., and Vaidya, P. M., A Cutting Plane Algorithm that Uses Analytic Centers, Mathematical Programming, Vol. 69, pp. 1–43, 1995.
Goffin, J. L., Luo, Z., and Ye, Y., Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems, SIAM Journal on Optimization, Vol. 6, pp. 638–652, 1996.
Altman, A., and Kiwiel, K. C., A Note on Some Analytic Center Cutting Plane Methods for Convex Feasibility and Minimization Problems, Computational Optimization and Applications, Vol. 5, pp. 175–180, 1996.
Ye, Y., Complexity Analysis of the Analytic Center Cutting Plane Method that Uses Multiple Cuts, Mathematical Programming, Vol. 78, pp. 85–104, 1997.
Luo, Z., Analysis of a Cutting Plane Method that Uses Weighted Analytic Centers and Multiple Cuts, SIAM Journal on Optimization, Vol. 7, pp. 697–716, 1997.
Goffin, J. L., and Vial, J. P., Shallow, Deep, and Very Deep Cuts in the Analytic Center Cutting Plane Method, Mathematical Programming, Vol. 84, pp. 89–103, 1999.
Mitchell, J. E., and Todd, M. J., Solving Combinatorial Optimization Problems Using Karmarkar's Algorithm, Mathematical Programming, Vol. 56, pp. 245–284, 1992.
Mizuno, S., A New Polynomial Time Method for a Linear Complementarity Problem, Mathematical Programming, Vol. 56, pp. 31–43, 1992.
Den Hertog, D., Roos, C., and Vial, J. P., A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming, SIAM Journal on Optimization, Vol. 2, pp. 71–87, 1992.
Gonzaga, C. C., Path-Following Methods for Linear Programming, SIAM Review, Vol. 34, pp. 167–224, 1992.
Anstreicher, K., Dual Ellipsoids and Degeneracy in the Projective Algorithm for Linear Programming, Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference, Bowdoin College, Brunswick, Maine, 1988, Edited by J. C. Lagarias and M. J. Todd; Contemporary Mathematics, American Mathematical Society, Providence, Rhode Island, Vol. 114, pp. 141–149, 1990.
Todd, M. J., Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm, Mathematics of Operations Research, Vol. 13, pp. 650–659, 1988.
Ye, Y., Karmarkar's Algorithm and the Ellipsoid Method, Operations Research Letters, Vol. 4, pp. 177–182, 1987.
Ye, Y., and Todd, M. J., Containing and Shrinking Ellipsoids in the Path-Following Algorithm, Mathematical Programming, Vol. 47, pp. 1–10, 1990.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Goffin, J.L., Sharifi-Mokhtarian, F. Primal–Dual–Infeasible Newton Approach for the Analytic Center Deep-Cutting Plane Method. Journal of Optimization Theory and Applications 101, 35–58 (1999). https://doi.org/10.1023/A:1021714926231
Issue Date:
DOI: https://doi.org/10.1023/A:1021714926231