Greedy strategies for convex optimization

DOI10.1007/s10092-016-0183-2zbMath1371.65057arXiv1401.1754OpenAlexW1607608767MaRDI QIDQ2363679

Hao Nguyen, Guergana Petrova

Publication date: 25 July 2017

Published in: Calcolo (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationHilbert spacerates of convergencegreedy algorithmsorthogonal matching pursuit algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (9)

Convex optimization on Banach spaces ⋮ Rescaled pure greedy algorithm for Hilbert and Banach spaces ⋮ Unified error estimate for weak biorthogonal Greedy algorithms ⋮ 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

• Convex optimization on Banach spaces
• Greedy expansions in convex optimization
• Some remarks on greedy algorithms
• Greedy approximation in convex optimization
• Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
• Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
• Greedy Approximation
• Decoding by Linear Programming
• Uniformly convex functions on Banach spaces
• Sequential greedy approximation for certain convex optimization problems
• Matching pursuits with time-frequency dictionaries
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• Compressed sensing
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy strategies for convex optimization