Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
From MaRDI portal
Publication:2117632
DOI10.1007/978-3-030-77876-7_13zbMATH Open1487.90528OpenAlexW3166600922MaRDI QIDQ2117632FDOQ2117632
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_13
convex optimizationBanach spaceduality gapgreedy algorithmscardinality-constrained optimization problem
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Cites Work
- Greedy function approximation: A gradient boosting machine.
- Projection pursuit
- Approximation and learning by greedy algorithms
- Compressed sensing
- Adaptive greedy approximations
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Some remarks on greedy algorithms
- A remark on greedy approximation in Banach spaces.
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Accuracy Certificates for Computational Problems with Convex Structure
- Title not available (Why is that?)
- Greedy strategies for convex optimization
- Convex optimization on Banach spaces
- New analysis and results for the Frank-Wolfe method
- Greedy approximation in convex optimization
- Dictionary descent in optimization
- Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
- Complexity bounds for primal-dual methods minimizing the model of objective function
- A unified way of analyzing some greedy algorithms
- Algorithms for \(l_{1}\)-norm minimisation of index tracking error and their performance
Cited In (2)
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)
