Local linear convergence of proximal coordinate descent algorithm
From MaRDI portal
Recommendations
- On the iteration complexity of cyclic coordinate gradient descent methods
- On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- A coordinate gradient descent method for nonsmooth separable minimization
Cites work
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Accelerated block-coordinate relaxation for regularized optimization
- Accelerated, parallel, and proximal coordinate descent
- Active Sets, Nonsmoothness, and Sensitivity
- Activity identification and local linear convergence of forward-backward-type methods
- Atomic Decomposition by Basis Pursuit
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Consistency of the group Lasso and multiple kernel learning
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- Coordinate descent with arbitrary sampling. I: Algorithms and complexity.
- Coordinate descent with arbitrary sampling. II: Expected separable overapproximation.
- Dual extrapolation for sparse GLMs
- Efficiency of coordinate descent methods on huge-scale optimization problems
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6253925 (Why is no real title available?)
- Identifiable Surfaces in Constrained Optimization
- Identifying active manifolds in regularization problems
- Identifying active manifolds.
- Iteration complexity analysis of block coordinate descent methods
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Linear convergence of first order methods for non-strongly convex optimization
- Local Linear Convergence of ISTA and FISTA on the LASSO Problem
- Model Consistency of Partly Smooth Regularizers
- Model selection with low complexity priors
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- On the Goldstein-Levitin-Polyak gradient projection method
- On the Identification of Active Constraints
- On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
- Pathwise coordinate optimization
- Prox-regular functions in variational analysis
- Randomized methods for linear constraints: convergence rates and conditioning
- Regularization and Variable Selection Via the Elastic Net
- Relating _p regularization and reweighted _1 regularization
- Scikit-learn: machine learning in Python
- Sensitivity analysis for mirror-stratifiable convex functions
- Signal Recovery by Proximal Forward-Backward Splitting
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Stochastic dual coordinate ascent methods for regularized loss minimization
This page was built for publication: Local linear convergence of proximal coordinate descent algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181368)