Greedy expansions in convex optimization

V. N. Temlyakov

Trudy Matematicheskogo Instituta imeni V.A. Steklova, Function spaces and related problems of analysis, Tome 284 (2014), pp. 252-270.

Résumé

This paper is a follow-up to the author's previous paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation for finding sparse solutions of convex optimization problems. We modified there the three most popular greedy algorithms in nonlinear approximation in Banach spaces – Weak Chebyshev Greedy Algorithm, Weak Greedy Algorithm with Free Relaxation, and Weak Relaxed Greedy Algorithm – for solving convex optimization problems. We continue to study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements from a given system of elements. There is an increasing interest in building such sparse approximate solutions using different greedy-type algorithms. In this paper we concentrate on greedy algorithms that provide expansions, which means that the approximant at the $m$th iteration is equal to the sum of the approximant from the previous, $(m-1)$th, iteration and one element from the dictionary with an appropriate coefficient. The problem of greedy expansions of elements of a Banach space is well studied in nonlinear approximation theory. At first glance the setting of a problem of expansion of a given element and the setting of the problem of expansion in an optimization problem are very different. However, it turns out that the same technique can be used for solving both problems. We show how the technique developed in nonlinear approximation theory, in particular, the greedy expansions technique, can be adjusted for finding a sparse solution of an optimization problem given by an expansion with respect to a given dictionary.

Bibliographie

[1] Bari N.K., Trigonometricheskie ryady, Fizmatgiz, M., 1961 | MR

[2] Borwein J.M., Lewis A.S., Convex analysis and nonlinear optimization. Theory and examples, Springer, New York, 2006 | MR

[3] Chandrasekaran V., Recht B., Parrilo P.A., Willsky A.S., “The convex algebraic geometry of linear inverse problems”, Communication, control, and computing, Proc. 48th Annu. Allerton Conf., IEEE Press, Piscataway, NJ, 2010, 699–703

[4] DeVore R.A., “Nonlinear approximation”, Acta numerica, 7 (1998), 51–150 | DOI | MR | Zbl

[5] Habala P., Hájek P., Zizler V., Introduction to Banach spaces, V. 1, Matfyzpress, Prague, 1996 | Zbl

[6] Nemirovski A., Optimization. II: Numerical methods for nonlinear continuous optimization, Technion — Isr. Inst. Technol., Haifa, 1999

[7] Nesterov Yu., Introductory lectures on convex optimization: A basic course, Kluwer, Boston, 2004 | MR | Zbl

[8] Shalev-Shwartz S., Srebro N., Zhang T., “Trading accuracy for sparsity in optimization problems with sparsity constraints”, SIAM J. Optim., 20:6 (2010), 2807–2832 | DOI | MR | Zbl

[9] Temlyakov V.N., “Greedy algorithms and $m$-term approximation with regard to redundant dictionaries”, J. Approx. Theory, 98 (1999), 117–145 | DOI | MR | Zbl

[10] Temlyakov V.N., “Weak greedy algorithms”, Adv. Comput. Math., 12:2–3 (2000), 213–227 | DOI | MR | Zbl

[11] Temlyakov V.N., “Greedy-type approximation in Banach spaces and applications”, Constr. Approx., 21:2 (2005), 257–292 | DOI | MR | Zbl

[12] Temlyakov V.N., “Greedy approximation”, Acta numerica, 17 (2008), 235–409 | DOI | MR | Zbl

[13] Temlyakov V., Greedy approximation, Cambridge Univ. Press, Cambridge, 2011 | MR | Zbl

[14] Temlyakov V.N., Greedy approximation in convex optimization, IMI Preprint N 03, Univ. South Carolina, Columbia, SC, 2012 ; arXiv: 1206.0392v1 [stat.ML] | MR

[15] Temlyakov V.N., Greedy expansions in convex optimization, IMI Preprint N 05, Univ. South Carolina, Columbia, SC, 2012, arXiv: 1206.0393v1 [stat.ML]

[16] Tewari A., Ravikumar P., Dhillon I.S., “Greedy algorithms for structurally constrained high dimensional problems”, Adv. Neural Inf. Process. Syst., 24 (2011), 882–890

[17] Zhang T., “Sequential greedy approximation for certain convex optimization problems”, IEEE Trans. Inf. Theory, 49:3 (2003), 682–691 | DOI | MR | Zbl