Greedy expansions in convex optimization

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 algorithm...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the Steklov Institute of Mathematics Ročník 284; číslo 1; s. 244 - 262
Hlavný autor:	Temlyakov, V. N.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.05.2014
Predmet:	Mathematics Mathematics and Statistics Convex Optimization Problem STEKLOV Institute Convex Optimization Greedy Algorithm Nonlinear Approximation
ISSN:	0081-5438, 1531-8605
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!