Convex optimization on Banach spaces
From MaRDI portal
Publication:285434
DOI10.1007/s10208-015-9248-xzbMath1347.41032arXiv1401.0334OpenAlexW2130275023MaRDI QIDQ285434
Vladimir N. Temlyakov, Ronald A. DeVore
Publication date: 19 May 2016
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.0334
Numerical mathematical programming methods (65K05) Geometry and structure of normed linear spaces (46B20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items
Greedy strategies for convex optimization, Biorthogonal greedy algorithms in convex optimization, Convergence and rate of convergence of some greedy algorithms in convex optimization, Rescaled pure greedy algorithm for convex optimization, On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, Schwarz iterative methods: infinite space splittings, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, Greedy approximation in convex optimization, Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
Cites Work
- Unnamed Item
- Greedy expansions in convex optimization
- Convex analysis and nonlinear optimization. Theory and examples.
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Introductory lectures on convex optimization. A basic course.
- Greedy-type approximation in Banach spaces and applications
- The convex geometry of linear inverse problems
- Greedy strategies for convex optimization
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
- Greedy Approximation
- Sequential greedy approximation for certain convex optimization problems
