Dictionary descent in optimization

Preprint English OPEN
Temlyakov, Vladimir;
  • Subject: Statistics - Machine Learning | Mathematics - Numerical Analysis

The problem of convex optimization is studied. Usually in convex optimization the minimization is over a d-dimensional domain. Very often the convergence rate of an optimization algorithm depends on the dimension d. The algorithms studied in this paper utilize dictionar... View more
  • References (19)
    19 references, page 1 of 2

    [1] J.M. Borwein and A.S. Lewis, Convex Analysis and Nonlinear Optimization. Theory and Examples, Canadian Mathematical Society, Springer, 2006.

    [2] R.A. DeVore, Deterministic Constructions of Compressed Sensing Matrices J. Complexity, 23 (2007), 918-925.

    [3] R.A. DeVore and V.N. Temlyakov, Convex optimization on Banach spaces, Foundations of Computational Mathematics, Published online: February 14, 2015, 1-26 (arXiv:1401.0334v1, 1 Jan 2014).

    [4] I. Dumer, Covering spheres with spheres, Discrete Comput. Geom. 38 (2007), 665-679.

    [5] M.A.T. Figueiredo, R.D. Nowak, and S.J. Wright, Gradient projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems, IEEE, Selected Topics in Signal Processing, 1 (2007), 586-597.

    [6] A.C. Gilbert, S. Muthukrishnan and M.J. Strauss, Approximation of functions over redundant dictionaries using coherence, The 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003).

    [7] B.S. Kashin, On widths of octahedrons, Uspekhi Matem. Nauk, 30 (1975), 251-252.

    [8] J.L. Nelson and V.N. Temlyakov, On the size of incoherent systems, J. Approximation Theory, 163 (2011), 1238-1245.

    [9] Yu. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, Kluwer Academic Publishers, Boston, 2004.

    [10] C.A. Rogers, Covering a sphere with spheres, Mathematika 10 (1963), 157-164.

  • Related Organizations (1)
  • Metrics
Share - Bookmark