Dictionary descent in optimization

DOI10.1007/s10476-016-0106-0zbMath1374.41047arXiv1511.01304MaRDI QIDQ519963

Vladimir N. Temlyakov

Publication date: 31 March 2017

Published in: Analysis Mathematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.01304

zbMATH Keywords

optimization; Banach space; convergence rate; sparse; greedy

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

46B20: Geometry and structure of normed linear spaces

41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)

41A46: Approximation by arbitrary nonlinear expressions; widths and entropy

Related Items

On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, Duality gap estimates for a class of greedy optimization algorithms in Banach spaces, Alternating projections, remotest projections, and greedy approximation, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Greedy expansions in convex optimization
• On the size of incoherent systems
• Convex analysis and nonlinear optimization. Theory and examples.
• Introductory lectures on convex optimization. A basic course.
• Covering a ball with smaller equal balls in \(\mathbb R^n\)
• Greedy approximation in convex optimization
• Deterministic constructions of compressed sensing matrices
• Covering spheres with spheres
• SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
• Incoherent systems and coverings in finite dimensional Banach spaces
• Greedy Approximation
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• Covering a sphere with spheres
• Greedy algorithms in Banach spaces