Duality Gap Estimates for Weak Chebyshev Greedy Algorithms in Banach Spaces

The paper studies weak greedy algorithms for finding sparse solutions of convex optimization problems in Banach spaces. We consider the concept of duality gap, the values of which are implicitly calculated at the step of choosing the direction of the fastest descent at each iteration of the greedy a...

Celý popis

Podrobná bibliografia

Vydané v:	Computational mathematics and mathematical physics Ročník 59; číslo 6; s. 904 - 914
Hlavní autori:	Mironov, S. V., Sidorov, S. P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.06.2019 Springer Nature B.V
Predmet:	Algorithms Banach spaces Chebyshev approximation Computational geometry Computational Mathematics and Numerical Analysis Convexity Greedy algorithms Mathematics Mathematics and Statistics Optimization Upper bounds greedy algorithms sparse solution nonlinear optimization
ISSN:	0965-5425, 1555-6662
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!