Pages that link to "Item:Q263212"
From MaRDI portal
The following pages link to Parallel coordinate descent methods for big data optimization (Q263212):
Displaying 31 items.
- Analyzing large datasets with bootstrap penalization (Q2980232) (← links)
- A Randomized Coordinate Descent Method with Volume Sampling (Q3300772) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- Solving Fused Penalty Estimation Problems via Block Splitting Algorithms (Q3391427) (← links)
- Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
- Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
- Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
- (Q4558169) (← links)
- Perturbed Iterate Analysis for Asynchronous Stochastic Optimization (Q4588862) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (Q4636997) (← links)
- A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications (Q4687241) (← links)
- (Q4999081) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer (Q5072590) (← links)
- Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing (Q5268929) (← links)
- Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
- Convergence Analysis of Inexact Randomized Iterative Methods (Q5856678) (← links)
- Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems (Q5864786) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- Block delayed Majorize-Minimize subspace algorithm for large scale image restoration <sup>*</sup> (Q5885760) (← links)
- Block-cyclic stochastic coordinate descent for deep neural networks (Q6054553) (← links)
- Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) (← links)
- Faster randomized block sparse Kaczmarz by averaging (Q6109882) (← links)
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
- Global optimization using random embeddings (Q6160282) (← links)
- Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)