Duality gap estimates for a class of greedy optimization algorithms in Banach spaces

DOI10.1007/978-3-030-77876-7_13zbMath1487.90528OpenAlexW3166600922MaRDI QIDQ2117632

Yanyan Li

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_13

zbMATH Keywords

convex optimizationduality gapBanach spacegreedy algorithmscardinality-constrained optimization problem

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy function approximation: A gradient boosting machine.
• Convex optimization on Banach spaces
• Dictionary descent in optimization
• Projection pursuit
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Complexity bounds for primal-dual methods minimizing the model of objective function
• Some remarks on greedy algorithms
• Algorithms for \(l_{1}\)-norm minimisation of index tracking error and their performance
• A unified way of analyzing some greedy algorithms
• Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
• Greedy approximation in convex optimization
• Greedy strategies for convex optimization
• Approximation and learning by greedy algorithms
• Accuracy Certificates for Computational Problems with Convex Structure
• Compressed sensing
• Adaptive greedy approximations
• New analysis and results for the Frank-Wolfe method

This page was built for publication: Duality gap estimates for a class of greedy optimization algorithms in Banach spaces