An interior-point trust-region algorithm for general symmetric cone programming

SIAM Journal on Optimization

Volumn 18, Issue 1, 2007, Pages 65-86

  Lu, Ye ^a   Yuan, Ya Xiang ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Interior point algorithm; Symmetric cone; Trust region subproblem

Indexed keywords

INTERIOR-POINT ALGORITHMS; SYMMETRIC CONE; SYMMETRIC CONE PROGRAMMING;

ALGORITHMS; MATHEMATICAL MODELS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 39449113661     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040611756     Document Type: Article

References (33)

1. P. A. ABSIL AND A. L. TITS, Newton-KKT interior-point methods for indefinite quadratic programming, Comput. Optim. Appl., to appear.
2. F. ALIZADEH AND D. GOLDFARB, Second-order cone programming, Math. Program., 95 (2003), pp. 3-51.
3. A. S. EL BAKRY, R. A. TAPIA, T. TSUCHIYA, AND Y. ZHANG, On the formulation and theory of Newton interior point methods for nonlinear programming, J. Optim. Theory Appl., 89 (1996), pp. 507-541.
4. A. BARVINOK, A Course in Convexity, AMS, Providence, RI, 2002.
5. J. F. BONNANS AND A. SHAPIRO, Perturbation Analysis of Optimization Problems, Springer-Verlag, New York, 2000.
6. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, Trust-Region Methods, SIAM, Philadelphia, 2000.
7. A. R. CONN, N. I. M. GOULD, D. ORBAN, AND PH. L. TOINT, A primal-dual trust-region algorithm for nonconvex nonlinear programming, Math. Program., 87 (2000), pp. 215-249.
8. I. I. DIKIN, Iterative solution of problems of linear and quadratic programming, Soviet Math. Dokl., 8 (1967), pp. 674-675.
9. J. FARAUT AND A. KORANYI, Analysis on Symmetric Cones, Oxford University Press, New York, 1996.
10. L. FAYBUSOVICH AND T. TSUCHIYA, Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank, Math. Program., 97 (2003), pp. 471-493.
11. L. FAYBUSOVICH AND Y. LU, Jordan-algebraic aspects of nonconvex optimization over symmetric cone, Appl. Math. Optim., 53 (2006), pp. 67-77.
12. A. FORSGREN AND P. E. GILL, Primal-dual interior methods for nonconvex nonlinear programming, SIAM J. Optim., 8 (1998), pp. 1132-1152.
13. D. M. GAY, M. L. OVERTON, AND M. H. WRIGHT, A primal-dual interior method for nonconvex nonlinear programming, in Advances in Nonlinear Programming, Y. Yuan, ed., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998, pp. 31-56.
14. N. I. M. GOULD, S. LUCIDI, M. ROMA, AND PH. L. TOINT, Solving the trust-region subproblem using the Lanczos method, SIAM J. Optim., 9 (1999), pp. 504-525.
15. N. I. M. GOULD, M. E. HRIBAR, AND J. NOCEDAL, On the solution of equality constrained quadratic programming problems arising in optimization, SIAM J. Sci. Comput., 23 (2001), pp. 1376-1395.
16. J. GRIFFIN AND P. E. GILL, Trust-region interior methods for large-scale optimization, in Proceedings of the Eighth SIAM Conference on Optimization, Stockholm, Sweden, 2005.
17. Y. LU AND Y. YUAN, An Interior-Point Trust-Region Polynomial Algorithm for Convex Programming, Technical report, Department of Mathematics, University of Notre Dame, Notre Dame, IN, 2006.
18. Y. E. NESTEROV AND A. S. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.
19. F. RENDEL AND H. WOLKOWICZ, A semidefinite framework for trust region subproblem with applications to large scale minimization, Math. Programming, 77 (1997), pp. 273-299.
20. J. RENEGAR, A Mathematical View of Interior-Point Methods in Convex Programming, SIAM, Philadelphia, 2001.
21. M. ROJAS, S. A. SANTOS, AND D. C. SORENSEN, A new matrix-free algorithm for the large-scale trust-region subproblem, SIAM J. Optim., 11 (2000), pp. 611-646.
22. D. C. SORENSEN, Minimization of a large-scale quadratic function subject to a spherical constraint, SIAM J. Optim., 7 (1997), pp. 141-161.
23. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), pp. 626-637.
24. J. SUN, A convergence proof for an affine-scaling method for convex quadratic programming without nondegeneracy assumptions, Math. Programming, 60 (1993), pp. 69-79.
25. A. L. TITS, A. WÄCHTER, S. BAKHTIARI, T. J. URBAN, AND C. T. LAWRENCE, A primal-dual interior-point method for nonlinear programming with strong global and local convergence properties, SIAM J. Optim., 14 (2003), pp. 173-199.
26. PH. L. TOINT, Towards an efficient sparsity exploiting Newton method for minimization, in Sparse Matrices and Their Uses, I. S. Duff, ed., Academic Press, London, 1981, pp. 57-88.
27. R. J. VANDERBEI AND D. F. SHANNO, An interior-point algorithm for nonconvex nonlinear programming, Comput. Optim. Appl., 13 (1999), pp. 231-252.
28. A. WÄCHTER, An Interior Point Algorithm for Large-Scale Nonlinear Optimization with Applications in Process Engineering, Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, 2002.
29. Y. YE, On an affine scaling algorithm for non-convex quadratic programming, Math. Programming, 52 (1992), pp. 285-300.
30. Y. YE, Interior Point Algorithms: Theory and Analysis, John Wiley and Sons, New York, 1997.
31. Y. YE AND S. ZHANG, New results on quadratic minimization, SIAM J. Optim., 14 (2003), pp. 245-267.
32. Y. YUAN, On the truncated conjugate gradient method, Math. Program., 87 (2000), pp. 561-571.
33. S. ZHANG, Quadratic maximization and semidefinite relaxation, Math. Program., 87 (2000), pp. 453-465.