Abstract
Let\(S \subseteq \mathbb{R}^n \) be a convex set for which there is an oracle with the following property. Given any pointz∈ℝn the oracle returns a “Yes” ifz∈S; whereas ifz∉S then the oracle returns a “No” together with a hyperplane that separatesz fromS. The feasibility problem is the problem of finding a point inS; the convex optimization problem is the problem of minimizing a convex function overS. We present a new algorithm for the feasibility problem. The notion of a volumetric center of a polytope and a related ellipsoid of maximum volume inscribable in the polytope are central to the algorithm. Our algorithm has a significantly better global convergence rate and time complexity than the ellipsoid algorithm. The algorithm for the feasibility problem easily adapts to the convex optimization problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G.A. Bliss,Lectures on the Calculus of Variations, Phoenix Science Series (The University of Chicago Press, Chicago, IL, 1946).
S. Bochner and W.T. Martin,Several Complex Variables (Princeton University Press, Princeton, NJ, 1948).
D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,”Proceedings 19th Annual ACM Symposium Theory of Computing (1987) pp. 1–6.
M. Grotschel, L. Lovasz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
M. Minoux,Mathematical Programming: Theory and Algorithms (Wiley, New York, 1986).
J. Renegar, “A polynomial-time algorithm based on Newton's method for linear programming,”Mathematical Programming 40 (1988) 59–93.
P.M. Vaidya, “An algorithm for linear programming that requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations,”Proceedings 19th Annual ACM Symposium Theory of Computing (1987) pp. 29–38; also inMathematical Programming 47 (1990) 175–201.
P.M. Vaidya, “Speeding-up linear programming using fast matrix multiplication,”Proceedings 30th Annual IEEE Symposium Foundations of Computer Science (1989) pp. 338–343.
P.M. Vaidya, “A new algotrithm for minimizing convex functions over convex sets,”Proceedings 30th Annual IEEE Symposium Foundations of Computer Science (1989) pp. 332–337.
Gy. Sonevand, “An analytical center for polyhedrons and new classes of global algorithms for linear (smooth convex) programming,” Preprint, Department of Numerical Analysis, Institute of Mathematics, Eotvos University (Budapest, 1989) pp. 6–8.
J.L. Goffin and J.P. Vial, “Cutting planes and column generation techniques with the projective algorithm”, CORE Discussion Paper 8829, CORE, Universite Catholique de Louvain (Louvain, Belgium, 1988).
Y. Ye, “A potential reduction algorithm allowing column generation”, Working paper, Department of Management Sciences, University of Iowa (Iowa City, IA, 1989).
S.P. Tarasov, L.G. Khachiyan and I.I. Erlich, “The method of inscribed ellipsoids,”Soviet Mathematics Doklady 37(1) (1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vaidya, P.M. A new algorithm for minimizing convex functions over convex sets. Mathematical Programming 73, 291–341 (1996). https://doi.org/10.1007/BF02592216
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592216