Greedy expansions in convex optimization
From MaRDI portal
Publication:483395
DOI10.1134/S0081543814010180zbMath1306.49052arXiv1206.0393MaRDI QIDQ483395
Publication date: 17 December 2014
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.0393
Related Items (8)
Greedy strategies for convex optimization ⋮ Convex optimization on Banach spaces ⋮ 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 ⋮ Greedy expansions in convex optimization ⋮ Dictionary descent in optimization ⋮ Greedy approximation in convex optimization
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
- Weak greedy algorithms
- Greedy approximation in convex optimization
- Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
- Greedy Approximation
- Greedy approximation
- Sequential greedy approximation for certain convex optimization problems
This page was built for publication: Greedy expansions in convex optimization
