Biorthogonal Greedy Algorithms in convex optimization

The study of greedy approximation in the context of convex optimization is becoming a promising research direction as greedy algorithms are actively being employed to construct sparse minimizers for convex functions with respect to given sets of elements. In this paper we propose a unified way of an...

Full description

Bibliographic Details

Published in:	Applied and computational harmonic analysis Vol. 60; pp. 489 - 511
Main Authors:	Dereventsov, A.V., Temlyakov, V.N.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.09.2022
Subjects:	Banach space Biorthogonal Greedy Algorithm Convex optimization Greedy algorithm Sparsity Greedy algorithm Sparsity Biorthogonal Greedy Algorithm Banach space Convex optimization
ISSN:	1063-5203, 1096-603X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!