Abstract
We describe the analytic center cutting plane method and its relationship to classical methods of nondifferentiable optimization and column generation. Implementations issues are also discussed, and current applications listed.
Chapter PDF
References
D. S. Atkinson and P. M. Vaidya (1995), “A cutting plane algorithm that uses analytic centers”, Mathematical Programming, series B, 69, 1–43.
O. Bahn, O. du Merle, J.-L. Goffin and J.P. Vial (1995), “A Cutting Plane Method from Analytic Centers for Stochastic Programming”, Mathematical Programming, Series B, 69, 45–73.
O. Bahn, A. Haurie, S. Kypreos, and J.P. Vial, Advanced mathematical programming modeling to assess the benefits from international CO2 abatment cooperation, Technical Report 97.10, HEC/Management Studies, University of Geneva, Switzerland, 1997.
B. Biieler, Computing Economic Equilibria and its Application to International Trade of Permits: an Agent-Based Approach, PhD Thesis (forthcoming, December 1997), Swiss Federal Institute of Technology, Zurich, Switzerland, 1997.
M. Denault and J.-L. Goffin, “On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities”, GERAD Tech. Report G-97-56, 26 pp, September 1997.
O. du Merle, Interior points and cutting planes: development and implementation of methods for convex optimization and large scale structured linear programming, Ph.D Thesis, Department of Management Studies, University of Geneva, Geneva, Switzerland, 1995 (in French).
O. du Merle, J.-L. Goffin, C. Trouiller and J.-P. Vial, “A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm”, Logilab Technical Report 97.5, Department of Management Studies, University of Geneva, Switzerland, April 1997.
O. du Merle, P. Hansen, B. Jaumard, N. Mladenovic, “An Interior Point Algorithm for Minimum Sum of Squares Clustering”, GERAD Tech. Report G-97-53, August 1997, 28 pages.
E. Fragnière, J. Gondzio, R. Sarkissian and J.-Ph. Vial, Structure exploiting tool in algebraic modeling languages, Logilab Technical Report 97.2, Department of Management Studies, University of Geneva, Switzerland, June 1997.
J.-L. Goffin, O. du Merle and J.-P. Vial (1996), On the Comparative Behavior of Kelley’s Cutting Plane Method and the Analytic Center Cutting Plane Method, Technical Report 1996.4, Department of Management Studies, University of Geneva, Switzerland, March 1996. To appear in Computational Optimization and Applications.
J.-L. Goffin, J. Gondzio, R. Sarkissian and J.-P. Vial (1997), “Solving Nonlinear Multicommodity Flows Problems by the Analytic Center Cutting Plane Method”, Mathematical Programming, Series B, vol 76 1, 131–154.
J.-L. Goffin, A. Haurie and J.-P. Vial (1992), “Decomposition and nondifferentiable optimization with the projective algorithm”, Management Science 38, 284–302.
J.-L. Goffin, Z.-Q. Luo and Y. Ye (1996), “Complexity analysis of an interior cutting plane for convex feasibility problems”, SIAM Journal on Optimization, 6, 638–652.
J.-L. Goffin and J.-P. Vial (1993),“On the Computation of Weighted Analytic Centers and Dual Ellipsoids with the Projective Algorithm”, Mathematical Programming 60, 81–92.
J.-L. Goffin and J.-P. Vial (1996),“Shallow, deep and very deep cuts in the analytic center cutting plane method”, Logilab Technical Report 96-3, Department of Management Studies, University of Geneva, Switzerland. Revised June 1997 (to appear in Mathematical Programming)
J. Gondzio, O. du Merle, R. Sarkissian and J.-P. Vial (1996), “ACCPM — A Library for Convex Optimization Based on an Analytic Center Cutting Plane Method”, European Journal of Operational Research, 94, 206–211.
J. Gondzio, R. Sarkissian and J.-P. Vial, Using an Interior Point Method for the Master Problem in a Decomposition Approach, Technical Report European Journal of Operational Research, volume 101, 1997, 577–587.
J. Gondzio and J.-P. Vial, Warm Start and epsilon-subgradients in the Cutting Plane Scheme for Block-angular Linear Programs, Logilab Technical Report 97.1, Department of Management Studies, University of Geneva, Switzerland, June 1997. To appear in Computational Optimization and Applications.
P. Huard, “Resolution of Mathematical Programming with Nonlinear Constraints by the Method of Centers”, in J. Abadie, editor, Nonlinear Programming, pages 207–219. North Holland, Amsterdam, The Netherlands, 1967.
K.L. Jones, I.J. Lustig, J.M. Farvolden and W.B. Powell, Multicommodity ntwork flows: the impact of formulation on decomposition, Mathematical Programming, volume 62, 1993, 95–117.
N.K. Karmarkar (1984), “A New Polynomial-Time Algorithm for Linear Programming”, Combinatorica 4, 373–395.
C. Lemaréchal, A. Nemirovskii, Y. Nesterov, “New Variants of Bundle Methods”, Rapports de Recherche INRIA No 1508 (1991), INRIA-Rocquencourt, also Mathematical Programming 69 (1995), 111–147.
A. Lisser, R. Sarkissian and J.-P. Vial, Optimal joint synthesis of base and reserve telecommunication networks, CNET Technical Note NT/PAA/ATR/ORI/4491, France Telecom, Issy-les-Moulineaux, France, November 1995.
J. E. Mitchell and M.J. Todd (1992), “Solving combinatorial optimization problems using Karmarkar’s algorithm,” Mathematical Programming 56, 245–284.
A.S. Nemirovskii and D.B. Yudin, “Problem Complexity and Method Efficiency in Optimization”, John Wiley, Chichester (1983).
Y. Nesterov (1995), “Cutting plane algorithms from analytic centers: efficiency estimates”, Mathematical Programming, series B, 69, 149–176.
Y. Nesterov, “Introductory Lectures on Convex programming”, Lecture Notes, CORE (1996).
Y. Nesterov and A.S. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming (SIAM, Philadelphia, 1994).
Y. Nesterov, J.-Ph. Vial, “Homogeneous analytic center cutting plane methods for convex problems and variational inequalities”, Logilab Technical Report 1997.4 (1997).
C. Roos et J.-P. Vial (1990), “Long steps with the logarithmic barrier function in linear programming”, in: Economic Decision Making: Games, Econometrics and Optimization, J. Gabszewicz, J.-F. Richard and L. Wolsey ed., Elsevier Science Publishers B. V., pp 433-441.
R. Sarkissian, Telecommunications Networks: Routing and Survivability Optimization Using a Central Cutting Plane Method, PhD thesis, Ecole Polytechnique Fédérale, Lausanne, Switzerland, 1997.
F. Sharifi-Mokhtarian and J.L. Goffin, “A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems,” Technical Report G-96-53, Groupe d’Études et de Recherche en Analyse des Décision, Université de Montréal, Canada, November 1996; also: SIAM Journal on Optimization, to appear in revised version.
G. Sonnevend, “New algorithms in convex programming based on a notion of “center” (for systems of analytic inequalities) and on rational extrapolation,” in: K. H. Hoffmann, J. B. Hiriart-Urruty, C. Lemaréchal, and J. Zowe, eds., Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization (Irsee, West-Germany, April 1986); also: International Series of Numerical Mathematics 84 (Birkhäuser Verlag, Basel, Switzerland, 1988) 311–327.
Vial, J.-P. (1996), “A generic path-following algorithm with a sliding constraint and its application to linear programming and the computation of analytic centers”, Technical Report 1996.8, LOGILAB/Management Studies, University of Geneva, Switzerland.
P. Wolfe (1975), “A Method of Conjugate Subgradients for Minimizing Non-differentiable Functions”, Mathematical Programming Study 3, pp 145–173.
Y. Ye (1992), “A potential reduction algorithm allowing column generation”, SIAM Journal on Optimization 2, 7–20.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goffin, JL., Vial, JP. (1998). Interior Point Methods for Nondifferentiable Optimization. In: Operations Research Proceedings 1997. Operations Research Proceedings, vol 1997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58891-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-58891-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64240-4
Online ISBN: 978-3-642-58891-4
eBook Packages: Springer Book Archive