A new algorithm for minimizing convex functions over convex sets

Mathematical Programming, Series B

Volumn 73, Issue 3, 1996, Pages 291-341

  Vaidya, Pravin M ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Complexity; Convex programming; Linear programming; Optimization

Indexed keywords

EID: 0001536423     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592216     Document Type: Article

References (14)

1. G.A. Bliss, Lectures on the Calculus of Variations, Phoenix Science Series (The University of Chicago Press, Chicago, IL, 1946).
2. S. Bochner and W.T. Martin, Several Complex Variables (Princeton University Press, Princeton, NJ, 1948).
3. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," Proceedings 19th Annual ACM Symposium Theory of Computing (1987) pp. 1-6.
4. M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
5. M. Minoux, Mathematical Programming: Theory and Algorithms (Wiley, New York, 1986).
6. J. Renegar, "A polynomial-time algorithm based on Newton's method for linear programming," Mathematical Programming 40 (1988) 59-93.
7. 1.5n)L) arithmetic operations," Proceedings 19th Annual ACM Symposium Theory of Computing (1987) pp. 29-38; also in Mathematical Programming 47 (1990) 175-201.
8. 1.5n)L) arithmetic operations," Proceedings 19th Annual ACM Symposium Theory of Computing (1987) pp. 29-38; also in Mathematical Programming 47 (1990) 175-201.
9. P.M. Vaidya, "Speeding-up linear programming using fast matrix multiplication," Proceedings 30th Annual IEEE Symposium Foundations of Computer Science (1989) pp. 338-343.
10. 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.
11. 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.
12. 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).
13. Y. Ye, "A potential reduction algorithm allowing column generation," Working paper, Department of Management Sciences, University of Iowa (Iowa City, IA, 1989).
14. S.P.Tarasov, L.G. Khachiyan and I.I. Erlich, "The method of inscribed ellipsoids," Soviet Mathematics Doklady 37(1) (1988).