Towards a practical volumetric cutting plane method for convex programming

SIAM Journal on Optimization

Volumn 9, Issue 1, 1998, Pages 190-206

  Anstreicher, Kurt M ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Convex programming; Cutting plane method; Volumetric barrier

Indexed keywords

EID: 0032243583     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497318013     Document Type: Article

References (22)

1. K. M. ANSTREICHER, Large step volumetric potential reduction algorithms for linear programming, Ann. Oper. Res., 62 (1996), pp. 521-538.
2. K. M. ANSTREICHER, Volumetric path following algorithms for linear programming, Math. Programming, 76 (1997), pp. 245-263.
3. K. M. ANSTREICHER, On Vaidya's volumetric cutting plane method for convex programming, Math. Oper. Res., 22 (1997), pp. 63-89.
4. D. S. ATKINSON AND P. M. VAIDYA, A cutting plane algorithm for convex programming that uses analytic centers, Math. Programming, 69 (1995), pp. 1-43.
5. R. G. BLAND, D. GOLDFARB, AND M. J. TODD, The ellipsoid method: A survey, Oper. Res., 29 (1981), pp. 1039-1091.
6. J.-L. GOFFIN, Using the Primal Dual Infeasible Newton Method in the Analytic Center Method for Problems Defined by Deep Cutting Planes, Tech. report, Faculty of Management, McGill University, Montreal, Canada, 1994.
7. J.-L. GOFFIN, Z.-Q. LUO, AND Y. YE, Complexity analysis of an interior cutting plane method for convex feasibility problems, SIAM J. Optim., 6 (1996), pp. 638-652.
8. J.-L. GOFFIN AND J.-PH. VIAL, Shallow, Deep, and Very Deep Cuts in the Analytic Center Cutting Plane Method, Logilab Tech. report 96.1, Dept. of Management Studies, University of Geneva, Switzerland, 1996.
9. M. GRÖTSCHEL, L. LOVASZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
10. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, 1985.
11. K. C. KIWIEL, Complexity of some cutting plane methods that use analytic centers, Math. Programming, 74 (1996), pp. 47-54.
12. A. Y. LEVIN, On an algorithm for minimizing a convex function, Soviet Math. Dokl., 6 (1965), pp. 286-290.
13. Z.-Q. LUO, Analysis of a cutting plane method that uses weighted analytic center and multiple cuts, SIAM J. Optim., 7 (1997), pp. 697-716.
14. J. E. MITCHELL AND M. J. TODD, Solving combinatorial optimization problems using Karmarkar's algorithm, Math. Programming, 56 (1992), pp. 245-284.
15. Y. NESTEROV, Complexity estimates of some cutting plane methods based on analytical barrier, Math. Programming, 69 (1995), pp. 149-176.
16. Y. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
17. S. RAMASWAMY AND J. E. MITCHELL, On Updating the Analytic Center after the Addition of Multiple Cuts, Tech. report 37-94-423, Decision Sciences and Engineering Systems Dept., Rensselaer Polytechnic Institute, Troy, NY, 1994.
18. S. RAMASWAMY AND J. E. MITCHELL, A Long Step Cutting Plane Algorithm that Uses the Volumetric Barrier, Tech. report, Dept. of Math. Sciences, Rensselaer Polytechnic Institute, Troy, NY, 1995.
19. S. P. TARASOV, L. G. KHACHIYAN, AND I. I. ERLICH, The method of inscribed ellipsoids, Soviet Math. Dokl., 37 (1988), pp. 226-230.
20. P. M. VAIDYA, A new algorithm for minimizing convex functions over convex sets, Math. Programming, 73 (1996), pp. 291-341.
21. B. YAMNITSKY AND L. A. LEVIN, An old linear programming algorithm runs in polynomial time, in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE, New York, 1982, pp. 327-328.
22. Y. YE, Complexity analysis of the analytic center cutting plane method that uses multiple cuts, Math. Programming, 78 (1997), pp. 85-104.