Abstract
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent some of the numerical instabilities and theoretical drawbacks usually associated with the algorithm are also provided. Moreover, for a large class of convex programs a simple proof of its rate of convergence is given and the relation with previously known results is discussed. Finally some computational results of the deep and central cut version of the algorithm applied to a min—max stochastic queue location problem are reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.S. Bazaraa and C.M. Shetty,Nonlinear Programming: Theory and Algorithms (Wiley, New York, 1979).
O. Berman, R.C. Larsen and S.S. Chiu, “Optimal server location on a network operating as an M/G/1 queue,”Operations Research 33 (1985) 746–771.
R.G. Bland, D. Goldfarb and M.J. Todd, “The ellipsoid method: A survey,”Operations Research 29 (1981) 1039–1091.
O.J. Boxma, “Workloads and waiting times in single-server systems with multiple customer classes,”Queueing Systems 5 (1989) 185–214.
R. Courant and H. Robbins,What is Mathematics? (Oxford University Press, Oxford, 1941).
A.Y. Dubovitsky and A.A. Milyutin, “Extremum problems in the presence of restriction,”USSR Computational Mathematics and Mathematical Physics 3 (1965) 1–80.
S.T. Dziuban, J.G. Ecker and M. Kupferschmid, “Using deep cuts in an ellipsoid algorithm for nonlinear programming,”Mathematical Programming Study 25(5) (1985) 93–107.
J.G. Ecker and M. Kupferschmid, “An ellipsoid algorithm for nonlinear programming,”Mathematical Programming 27 (1983) 83–106.
J.G. Ecker and M. Kupferschmid, “A computational comparison of the ellipsoid algorithm with several nonlinear programming algorithms,”SIAM Journal on Control and Optimization 23(5) (1985) 657–674.
J. Elzinga and D. Hearn, “Geometrical solutions for some minimax location problems,”Transportation Science 6 (1972) 379–394.
J.B.G. Frenk, J. Gromicho, M. Fridrich and S. Zhang, “An efficient algorithm to check whether0 belongs to the convex hull of a finite number ofℒ p -circles.” Report 9204/A, Erasmus University Rotterdam (Rotterdam, 1992).
J.B.G. Frenk, J. Gromicho and S. Zhang, “A deep cut ellipsoid method for quasiconvex programming,” (1992), in preparation.
J.B.G. Frenk, J. Gromicho and S. Zhang, “General models in min-max continuous location: Theory and solution techniques,” (1993), submitted for publication.
J.B.G. Frenk, M. Labbé, R. Visscher and S. Zhang, “The stochastic queue location problems in the plane,” Report 8948/A, Erasmus University Rotterdam (Rotterdam, 1989).
C. George.Exercises in Integration (Springer, New York, 1984).
J.L. Goffin, “Convergence rates of the ellipsoid method on general convex functions,”Mathematics of Operations Research 8 (1983) 135–150.
J.L. Goffin, “Variable metric relaxation methods, part II: The ellipsoid method,”Mathematical Programming 30 (1984) 147–162.
M. Grötschel, L. Lovàsz and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (1981) 169–197.
M. Grötschel, L. Lovàsz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
D.P. Heyman and M.J. Sobel,Stochastic Models in Operations Research, Vol. 1 (McGraw-Hill, New York, 1982).
L.G. Khachiyan, “A polynomial algorithm in linear programming,”Doklady Akademii Nauk SSSR 244 (1979) 1093–1979 [In Russian.]
L. Kleinrock,Queueing Systems: Theory, Vol. 1 (Wiley, New York, 1975).
P. Lancaster and M. Tismenetsky,The Theory of Matrices (Academic Press, New York, 2nd ed., 1985).
H.J. Luthi, “On the solution of variational inequalities by the ellipsoid method,”Mathematics of Operations Research 10 (1985) 515–522.
S. Masugama, T. Ibaraki and T. Hasegawa, “The computational complexity of them-center problems on the plane,”The Transactions of the IECE of Japan 64 (1981) 57–64.
N. Megiddo, “Linear-time algorithms for linear programming in ℝ3 and related problems,”SIAM Journal on Computing 12 (1983) 759–776.
K.P.K. Nair and R. Chandresakaran, “Optimal location of a single server center of certain types,”Naval Research Logistics Quarterly 18 (1971) 503–510.
G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988).
H. Rademacher and O. Toeplitz,The Enjoyment of Mathematics (Princeton University Press, Princeton, NJ, 1957).
M.I. Shamos and D. Hoey, “Closest-point problems,” in:Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science (1975) pp. 151–162.
N.Z. Shor, “Convergence rate of the gradient descent method with dilation of the space,”Cybernetics 6 (1970) 102–108.
N.Z. Shor, “Utilization of the operation of space dilation in the minimization of convex functions,”Cybernetics 6 (1970) 7–15.
N.Z. Shor, “Cut-off method with space extension in convex programming problems,”Cybernetics 12 (1977) 94–96.
N.Z. Shor, “New development trends in nondifferentiable optimization,”Cybernetics 13 (1977) 881–886.
N.Z. Shor and V.I. Gershovich, “Family of algorithms for solving convex programming problems,”Cybernetics 15 (1980) 502–508.
R.D. Smallwood, “Minimax detection station placement,”Operations Research 13 (1965) 636–646.
J.J. Sylvester, “A question in the geometry of the situation,”Quarterly Journal of Pure and Applied Mathematics 1 (1857) 79.
D.E. Varberg and A.W. Roberts,Convex Functions (Academic Press, New York, 1973).
J.E. Ward and R.E. Wendell, “Using blocks norms for location modelling,”Operations Research 33 (1985) 1074–1090.
A. Weber, “Uber den standort der industrien,” (1909).
Y. Ye, “Karmarkar's algorithm and the ellipsoid method,”Operations Research Letters 6 (1987) 177–182.
D.B. Yudin and A.S. Nemirovsky, “Evaluation of the informational complexity of mathematical programming problems,”Ekonomika i Matematicheskie Metody 12 (1976) 128–142 [In Russian.]
D.B. Yudin and A.S. Nemirovsky,” Informational complexity and efficient methods for the solution of convex extremal problems,”Ekonomika i Matematicheskie Metody 12 (1976) 357–369 [In Russian.]
S. Zhang, “Stochastic queue location problems,” PhD thesis, Tinbergen Institute Series 14 (Rotterdam, The Netherlands, 1991).
Author information
Authors and Affiliations
Additional information
Author on leave from D.E.I.O. (Universidade de Lisboa, Portugal). This research was supported by J.N.I.C.T. (Portugal) under contract number BD/631/90-RM.
Rights and permissions
About this article
Cite this article
Frenk, J.B.G., Gromicho, J. & Zhang, S. A deep cut ellipsoid algorithm for convex programming: Theory and applications. Mathematical Programming 63, 83–108 (1994). https://doi.org/10.1007/BF01582060
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582060