Smooth optimization with approximate gradient

SIAM Journal on Optimization

Volumn 19, Issue 3, 2008, Pages 1171-1183

  D'aspremont, Alexandre ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

First order methods; Semidefinite programming; Smooth optimization

Indexed keywords

APPROXIMATE GRADIENT; COMPUTATIONAL COSTS; EIGEN-VALUE; EIGENVALUES; FIRST-ORDER; FIRST-ORDER METHODS; MATRIX EXPONENTIALS; OPTIMAL COMPLEXITY; OPTIMIZATION ALGORITHMS; SEMIDEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; SMOOTH OPTIMIZATION; UNIFORMLY BOUNDED;

EIGENVALUES AND EIGENFUNCTIONS;

OPTIMIZATION;

EID: 57249107300     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/060676386     Document Type: Article

References (19)

1. A. Alon, N. Barkai, D. A. Notterman, K. Gish, S. Ybarra, D. Mack, and A. J. Levine, Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays, Cell Biology, 96 (1999), pp. 6745-6750.
2. A. Ben-Tal and A. Nemirovski, Non-Euclidean restricted memory level method for large-scale convex optimization, Math. Program., 102 (2005), pp. 407-456.
3. A. d'Aspremont, L. El Ghaoui, M. I. Jordan, and G. R. G. Lanckriet, A direct formulation for sparse PCA using semidefinite programming, SIAM Rev., 49 (2007), pp. 434-448.
4. P. DlACONlS, Patterns in eigenvalues: The 70th Josiah Willard Gibbs lecture, Bull. Amer. Math. Soc, 40 (2003), pp. 155-178.
5. G. H. Golub and C. F. Van Loan, Matrix computation, North Oxford Academic, Oxford, 1990.
6. C. Helmberg and F. Rendl, A spectral bundle method for semidefinite programming, SIAM J. Optim., 10 (2000), pp. 673-696.
7. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Springer, New York, 1993.
8. R. B. Lehoucq, D. C. Sorensen, and C. Yang, ARPACK: Solution of Large-scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, 1998.
9. A. S. Lewis and M. L. Overton, Eigenvalue optimization, Acta Numer., 5 (1996), pp. 149-190.
10. V. A. Marčenko and L. A. Pastur, Distribution of eigenvalues for some sets of random matrices, Math. Sb., 1 (1967), pp. 457-483.
11. C. Moler and C. Van Loan, Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later, SIAM Rev., 45 (2003), pp. 3-49.
12. A. Nemirovski, Prox-method with rate of convergence 0 (1/T) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems, SIAM J. Optim., 15 (2004), pp. 229-251.
13. 2), Soviet Math. Doklady, 27 (1983), pp. 372-376.
14. Y, Nesterov, Introductory Lectures on Convex Optimization, Springer, New York, 2003.
15. Y. Nesterov, Smooth minimization of non-smooth functions, Math. Program., 103 (2005), pp. 127-152.
16. Y. Nesterov, Smoothing technique and its applications in semidefinite optimization, Math. Program., 110 (2007), pp. 245-259.
17. M. L. Overton, Large scale optimization of eigenvalues, SIAM J. Optim., 2 (1992), pp. 88-120.
18. G. Pataki, On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues, Math. Oper. Res., 23 (1998), pp. 339-358.
19. N. Z. Shor, Minimization Methods for Non-differentiable Functions, Springer, Berlin, 1985.