Minimizing condition number via convex programming

SIAM Journal on Matrix Analysis and Applications

Volumn 32, Issue 4, 2011, Pages 1193-1211

  Lu, Zhaosong ^a   Pong, Ting Kei ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Condition number; Convex programming; Diagonal preconditioner; Semidefinite programming

Indexed keywords

COMPUTATIONAL RESULTS; CONDITION NUMBERS; CONVEX PROGRAMMING; CONVEX PROGRAMMING PROBLEMS; CONVEX RELAXATION; CONVEX SET; FIRST-ORDER; INTERIOR POINT; OPTIMAL VALUES; POSITIVE DEFINITE; POSITIVE SEMIDEFINITE MATRICES; POSITIVE-DEFINITE MATRICES; PRECONDITIONERS; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMMING PROBLEM;

NUMBER THEORY; RELAXATION PROCESSES; SET THEORY;

MATHEMATICAL PROGRAMMING;

EID: 84856251598     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/100795097     Document Type: Article

References (18)

1. A. AUSLENDER AND M. TEBOULLE, Asymptotic Cones and Functions in Optimization and Variational Inequalities, Springer, New York, 2003.
2. M. BENZI, Preconditioning techniques for large linear systems: A survey, J. Comput. Phys., 182 (2002), pp. 418-477. (Pubitemid 36010064)
3. D. BERTSEKAS AND J. N. TSITSIKLIS, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Upper Saddle River, NJ, 1989.
4. E. G. BIRGIN, J. M. MARTÍNEZ, AND M. RAYDAN, Nonmonotone spectral projected gradient methods on convex sets, SIAM J. Optim., 10 (2000), pp. 1196-1211.
5. S. BOYD AND L. VANDENBERGHE, Convex Optimization, Cambridge University Press, Cambridge, UK, 2004.
6. S. BURER AND R. D. C. MONTEIRO, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization, Math. Program., 95 (2003), pp. 329-357. (Pubitemid 44757858)
7. J. ECKSTEIN AND D. BERTSEKAS, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Program., 55 (1992), pp. 293-318.
8. V. GUIGUES, Inference statistique pour l'optimisation stochastique, Ph.D. thesis, Université Joseph Fourier, Grenoble, France, 2005.
9. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, Cambridge, UK, 2009.
10. G. LAN, Z. LU, AND R. D. C. MONTEIRO, Primal-dual first-order methods with O(1/e) iteration iteration-complexity for cone programming, Math. Program., 126 (2011), pp. 1-29.
11. Z. LU AND Y. ZHANG, An augmented Lagrangian approach for sparse principal component analysis, Math. Program., to appear.
12. Z. LU AND Y. ZHANG, Penalty Decomposition Methods for Rank Minimization, Technical report, Department of Mathematics, Simon Fraser University, Burnaby, BC, Canada, 2010.
13. P. MARÉCHAL AND J. J. YE, Optimizing condition numbers, SIAM J. Optim., 20 (2009), pp. 935-947.
14. G. PATAKI, On the closedness of the linear image of a closed convex cone, Math. Oper. Res., 32 (2007), pp. 395-412. (Pubitemid 351159491)
15. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
16. J. F. STURM, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 11/12 (1999), pp. 625-653.
17. R. H. TÜTÜNCÜ, K. C. TOH, AND M. J. TODD, Solving semidefinite-quadratic-linear programs using SDPT3, Math. Program., 95 (2003), pp. 189-217. (Pubitemid 44757853)
18. E. VAN DEN BERG AND M. P. FRIEDLANDER, Probing the Pareto frontier for basis pursuit solutions, SIAM J. Sci. Comput., 31 (2008), pp. 890-912.