Efficiency of coordinate descent methods on huge-scale optimization problems
From MaRDI portal
Recommendations
- Subgradient methods for huge-scale optimization problems
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Parallel coordinate descent methods for big data optimization
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
Cited in
(only showing first 100 items - show all)- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes
- Numerical experiments on stochastic block proximal-gradient type method for convex constrained optimization involving coordinatewise separable problems
- Two symmetrized coordinate descent methods can be \(O(n^2)\) times slower than the randomized version
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
- Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression
- Randomized block proximal damped Newton method for composite self-concordant minimization
- Inexact variable metric stochastic block-coordinate descent for regularized optimization
- Convergence analysis of two-level methods with general coarse solvers
- The Convergence and Error Analysis of Coordinate Descent Methods with Compression for Full Configuration Interaction
- Convergence analysis of the fast subspace descent method for convex optimization problems
- scientific article; zbMATH DE number 7626720 (Why is no real title available?)
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- Cyclic coordinate descent in the Hölder smooth setting
- Separable approximations and decomposition methods for the augmented Lagrangian
- Blocks of coordinates, stochastic programming, and markets
- Stochastic block-coordinate gradient projection algorithms for submodular maximization
- Introduction: Big data and partial differential equations
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Parallel coordinate descent methods for big data optimization
- On the convergence of a block-coordinate incremental gradient method
- Distributed Learning with Sparse Communications by Identification
- Schwarz iterative methods: infinite space splittings
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
- Adaptively weighted large-margin angle-based classifiers
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Inexact coordinate descent: complexity and preconditioning
- On optimal probabilities in stochastic coordinate descent methods
- The method of randomized Bregman projections for stochastic feasibility problems
- Accelerated directional search with non-Euclidean prox-structure
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
- scientific article; zbMATH DE number 6982318 (Why is no real title available?)
- Block layer decomposition schemes for training deep neural networks
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- A coordinate descent method for total variation minimization
- A geometric probability randomized Kaczmarz method for large scale linear systems
- Random batch methods (RBM) for interacting particle systems
- Convergence in distribution of randomized algorithms: the case of partially separable optimization
- slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks
- Subgradient methods for huge-scale optimization problems
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
- Analysis and design of optimization algorithms via integral quadratic constraints
- An accelerated randomized Kaczmarz algorithm
- A randomized sparse Kaczmarz solver for sparse signal recovery via minimax-concave penalty
- A parallel line search subspace correction method for composite convex optimization
- Primal-dual block-proximal splitting for a class of non-convex problems
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- Faster randomized block sparse Kaczmarz by averaging
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems
- The randomized block coordinate descent method in the Hölder smooth setting
- Conjugate gradients acceleration of coordinate descent for linear systems
- On the connections between optimization algorithms, Lyapunov functions, and differential equations: theory and insights
- Performance of Sine–Cosine Algorithm on Large-Scale Optimization Problems
- A class of parallel doubly stochastic algorithms for large-scale learning
- Online convex optimization using coordinate descent algorithms
- On the optimal order of worst case complexity of direct search
- Understanding large text corpora via sparse machine learning
- A guide to stochastic optimisation for large-scale inverse problems
- Feature selection method based on partial least squares and analysis of traditional Chinese medicine data
- Accelerating block coordinate descent methods with identification strategies
- A generic coordinate descent solver for non-smooth convex optimisation
- Randomized methods for computing optimal transport without regularization and their convergence analysis
- Efficient iterative learning model predictive control for uncertain nonlinear discrete-time systems
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- A class of coordinate descent methods with angle probability for solving linear systems
- Coordinate-friendly structures, algorithms and applications
- Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- Accelerated proximal envelopes: application to componentwise methods
- On the computational efficiency of catalyst accelerated coordinate descent
- Adaptive client sampling in federated learning via online learning with bandit feedback
- Unified analysis of stochastic gradient methods for composite convex and smooth optimization
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- Adaptive Catalyst for Smooth Convex Optimization
- Global optimization using random embeddings
- Randomized block coordinate descent method for linear ill-posed problems
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- An inexact variable metric proximal point algorithm for generic quasi-Newton acceleration
- On the convergence of the forward-backward splitting method with linesearches
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Sampling and update frequencies in proximal variance-reduced stochastic gradient methods
- First-order methods for convex optimization
- A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates
- Proximal Gradient Methods for Machine Learning and Imaging
- Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
- Via order markets towards price-taking equilibrium
- A distributed block coordinate descent method for training l₁ regularized linear classifiers
- Coordinate descent with arbitrary sampling. I: Algorithms and complexity.
- A unified analysis of variational inequality methods: variance reduction, sampling, quantization, and coordinate descent
- The cyclic block conditional gradient method for convex optimization problems
- Generalized affine scaling algorithms for linear programming problems
- Random descent steps in a probability maximization scheme
- Optimization methods for large-scale machine learning
- A coordinate-descent primal-dual algorithm with large step size and possibly nonseparable functions
- Stochastic accelerated alternating direction method of multipliers with importance sampling
- On the efficiency of random permutation for ADMM and coordinate descent
- Curvature-aware derivative-free optimization
- Fastest rates for stochastic mirror descent methods
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
This page was built for publication: Efficiency of coordinate descent methods on huge-scale optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910875)
