Polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities

Computational Optimization and Applications

Volumn 15, Issue 2, 2000, Pages 167-191

  Luo, Zhi Quan ^a   Sun, Jie ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; ITERATIVE METHODS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

ANALYTIC CENTER; COLUMN GENERATION; CONVEX FEASIBILITY PROBLEM; POTENTIAL REDUCTION;

MATHEMATICAL PROGRAMMING;

EID: 0033875233     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008787027641     Document Type: Article

References (20)

1. K. Afkhamie, Z.-Q. Luo, and K.M. Wong, "Interior point column generation algorithms for adaptive filtering," Manuscript, Communications Research Laboratory, McMaster University, Hamilton, Ontario, Canada, 1997.
2. A. Altman and K.C. Kiwiel, "A note on some analytic center cutting plane methods for convex feasibility and minimization problems," Systems Research Institute, Newelska 6, 01-447, Warsaw, Poland, June 1994.
3. D.S. Atkinson and P.M. Vaidya, "A cutting plane algorithm for convex programming that uses analytic centers," Mathematical Programming, vol. 69, pp. 1-44, 1995.
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 Applied Mathematics, vol. 49, pp. 3-23, 1994.
5. O. Bahn, O. Du Merle, J.-L. Goffin, and J.-P. Vial, "A cutting plane method from analytic centers for stochastic programming," Mathematical Programming, vol. 69, pp. 45-74, 1995.
6. D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, "A sufficient condition for self-concordance, with application to some classes of structured convex programming problems," Mathematical Programming, vol. 69, pp. 75-88, 1995.
7. J.-L. Goffin, Z.-Q. Luo, and Y. Ye, "Complexity analysis of an interior cutting plane method for convex feasibility problems," SIAM J. Optimization, vol. 6, pp. 638-652, 1996.
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 B.V., 1994, pp. 182-189.
9. J.-L. Goffin and J.-P. Vial, "Shallow, deep and very deep cuts in the analutic center cutting plane method," Logilab Technical Report 96.1, University of Geneva, Switzerland, 1996.
10. F. Jarre, The Method of Analytic Centers for Smooth Convex Programs, Ph.D. Thesis, Institut für Angwandte Mathematik und Statistik, Universität Würtzburg, Germany, 1989.
11. Z.-Q. Luo, "Analysis of a cutting plane method that uses weighted analytic center and multiple cuts," SIAM Journal on Optimization, vol. 7, pp. 697-716, 1997.
12. Z.-Q. Luo and J. Sun, "An analytic center based column generation algorithm for the convex quadratic feasibility problem," SIAM J. Optimization, vol. 9, no. 1, pp. 217-235, 1998.
13. S. Mehrotra and J. Sun, "An interior point algorithm for solving smooth convex programs based on Newton's method," Contemporary Mathematics, vol. 114, pp. 265-284, 1990.
14. S. Mehrotra and J. Sun, "On computing the center of a convex quadratically constrained set," Mathematical Programming, vol. 50, pp. 81-89, 1991.
15. Y. Nesterov, "Cutting plane algorithms from analytic centers: efficiency estimates," Mathematical Programming, vol. 69, pp. 149-176, 1995.
16. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, Philadelphia, USA, 1993.
17. M.L. Overton, "A quadratically convergent method for minimizing a sum of euclidean norms," Mathematical Programming, vol. 27, pp. 34-63, 1983.
18. G. Sonnevend, "New algorithms in convex programming based on a notion of 'centre' (for systems of analytic inequalities) and on rational extrapolation," in Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization in Irsee, K.H. Hoffmann, J.B. Hiriat-Urruty, C. Lemarechal, and J. Zowe, (Eds.), Germany, 1986.
19. Y. Ye, "A potential reduction algorithm allowing column generation," SIAM Journal on Optimization, vol. 2, pp. 7-20, 1992.
20. Y. Ye, "Complexity analysis of the analytic center cutting plane method that uses multiple cuts," Mathematical Programming, vol. 78, pp. 85-104, 1997.