Accelerating block coordinate descent methods with identification strategies
From MaRDI portal
Recommendations
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- Acceleration of block coordinate descent method achieves the $\bm{O(\frac{1}{k^2})}$ rate of convergence for a convex function with block coordinate strong convexity
- Accelerated block-coordinate relaxation for regularized optimization
- Coordinate descent algorithms
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A coordinate gradient descent method for nonsmooth separable minimization
- A fast active set block coordinate descent algorithm for _1-regularized least squares
- A flexible coordinate descent method
- A non-monotonic method for large-scale non-negative least squares
- A reduced-space algorithm for minimizing \(\ell_1\)-regularized convex functions
- Accelerated, parallel, and proximal coordinate descent
- Benchmarking optimization software with performance profiles.
- Compressed sensing
- Coordinate descent algorithms
- Coordinate descent with arbitrary sampling. I: Algorithms and complexity.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
- Efficient serial and parallel coordinate descent methods for huge-scale truss topology design
- Exact matrix completion via convex optimization
- Foundations of machine learning
- Inexact coordinate descent: complexity and preconditioning
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Model Selection and Estimation in Regression with Grouped Variables
- On the Accurate Identification of Active Constraints
- On the convergence of an active-set method for \(\ell_1\) minimization
- On the convergence of block coordinate descent type methods
- Parallel coordinate descent methods for big data optimization
- Sparse Reconstruction by Separable Approximation
- The University of Florida sparse matrix collection
Cited in
(7)- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- On the interplay between acceleration and identification for the proximal gradient algorithm
- An augmented Lagrangian approach for cardinality constrained minimization applied to variable selection problems
- Accelerated block-coordinate relaxation for regularized optimization
- A partially derivative-free cyclic block coordinate descent method for nonseparable composite optimization
- An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints
This page was built for publication: Accelerating block coordinate descent methods with identification strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419524)
