An analytic center based column generation algorithm for convex quadratic feasibility problems

SIAM Journal on Optimization

Volumn 9, Issue 1, 1998, Pages 217-235

  Luo, Zhi Quan ^a   Sun, Jie ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Analytic center; Column generation; Convex quadratic feasibility problem; Potential reduction

Indexed keywords

EID: 0041125582     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495294943     Document Type: Article

References (17)

1. A. ALTMAN AND K. C. KIWIEL, A note on some analytic center cutting plane methods for convex feasibility and minimization problems, Comput. Optim. Appl., 5 (1996), pp. 175-180.
2. D. S. ATKINSON, Scaling and Interior Point Methods in Optimization, Ph.D. thesis, Coordinated Science Laboratory, College of Engineering, University of Illinois at Urbana-Champaign, 1992.
3. D. S. ATKINSON AND P. M. VAIDYA, A cutting plane algorithm for convex programming that uses analytic centers, Math. Programming, 69 (1995), pp. 1-44.
4. O. BAHN, O. DU MERLE, J.-L. GOFFIN, AND J.-P. VIAL, Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Discrete Appl. Math., 49 (1994), pp. 3-23.
5. O. BAHN, O. DU MERLE, J.-L. GOFFIN, AND J.-P. VIAL, A cutting plane method from analytic centers for stochastic programming, Math. Programming, 69 (1995), pp. 45-74.
6. D. DEN HERTOG, C. ROOS, AND T. TERLAKY, On the classical logarithmic barrier function method for a class of smooth convex programming problems, J. Optim. Theory Appl., 73 (1992), pp. 1-25.
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, Z.-Q. LUO, AND Y. YE, On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems, in Large Scale Optimization: State of the Art, W. W. Hager, D. W. Hearn, and P. M. Pardalos, eds., Kluwer Academic Publishers, Norwell, MA, 1994, pp. 182-189.
9. F. JARRE, On the convergence of the method of analytic centers when applied to convex quadratic programs, Math. Programming, 49 (1991), pp. 341-358.
10. 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.
11. S. MEHROTRA AND J. SUN, A method of analytic centers for quadratically constrained convex quadratic programs, SIAM J. Numer. Anal., 28 (1991), pp. 529-544.
12. S. MEHROTRA AND J. SUN, On computing the center of a convex quadratically constrained set, Math. Programming, 50 (1991), pp. 81-89.
13. Y. NESTEROV, Cutting plane algorithms from analytic centers: Efficiency estimates, Math. Programming, 69 (1995), pp. 149-176.
14. Y. NESTEROV AND A. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, SIAM, Philadelphia, PA, 1994.
15. G. SONNEVEND, New algorithms in convex programming based on a notion of "centre" (for systems of analytic inequalities) and on rational extrapolation, Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization in Irsee, West Germany, 1986, Internat. Schriftenreiche Numer. Math. 84, K. H. Hoffmann, J.-B. Hiriart-Urruty, C. Lemarechal, and J. Zowe, eds., Birkhäuser, Boston, pp. 311-326.
16. Y. YE, A Potential reduction algorithm allowing column generation, SIAM J. Optim., 2 (1992), pp. 7-20.
17. Y. YE, Complexity analysis of the analytic center cutting plane method that uses multiple cuts, Math. Programming, 78 (1997), pp. 85-104.