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

Full description

Bibliographic Details

Published in:	Computational mathematics and mathematical physics Vol. 59; no. 6; pp. 904 - 914
Main Authors:	Mironov, S. V., Sidorov, S. P.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.06.2019 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!