Rescaled pure greedy algorithm for convex optimization
From MaRDI portal
Abstract: We suggest a new greedy strategy for convex optimization in Banach spaces and prove its convergent rates under a suitable behavior of the modulus of uniform smoothness of the objective function.
Recommendations
- Optimality of the rescaled pure greedy learning algorithms
- Rescaled coordinate descent methods for linear programming
- Greedy approximation in convex optimization
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Primal-dual nonlinear rescaling method for convex optimization
- Greedy strategies for convex optimization
- Improved algorithms for convex minimization in relative scale
- Rescaled proximal methods for linearly constrained convex problems
- Proximal point nonlinear rescaling method for convex optimization
- Greedy expansions in convex optimization
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A unified way of analyzing some greedy algorithms
- Convex optimization on Banach spaces
- Greedy approximation
- Greedy approximation in convex optimization
- Greedy expansions in convex optimization
- Greedy strategies for convex optimization
- On the generalized approximate weak Chebyshev greedy algorithm
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Sequential greedy approximation for certain convex optimization problems
- Some remarks on greedy algorithms
- Uniformly convex functions on Banach spaces
Cited in
(9)- On greedy approximation in complex Banach spaces
- Error bounds of approximate weak rescaled pure greedy algorithms
- Convex optimization on Banach spaces
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Biorthogonal greedy algorithms in convex optimization
- Brief introduction in greedy approximation
- Quadratic surface support vector machine with L1 norm regularization
- Greedy strategies for convex optimization
This page was built for publication: Rescaled pure greedy algorithm for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2424223)
