Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
From MaRDI portal
Publication:2117632
Recommendations
Cites work
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- A remark on greedy approximation in Banach spaces.
- A unified way of analyzing some greedy algorithms
- Accuracy certificates for computational problems with convex structure
- Adaptive greedy approximations
- Algorithms for \(l_{1}\)-norm minimisation of index tracking error and their performance
- Approximation and learning by greedy algorithms
- Complexity bounds for primal-dual methods minimizing the model of objective function
- Compressed sensing
- Convex optimization on Banach spaces
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Dictionary descent in optimization
- Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
- Greedy approximation in convex optimization
- Greedy function approximation: A gradient boosting machine.
- Greedy strategies for convex optimization
- New analysis and results for the Frank-Wolfe method
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Projection pursuit
- Some remarks on greedy algorithms
Cited in
(4)
This page was built for publication: Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117632)