Pages that link to "Item:Q2910875"

The following pages link to Efficiency of coordinate descent methods on huge-scale optimization problems (Q2910875):

Displaying 50 items.

• Iterative Proportional Scaling Revisited: A Modern Optimization Perspective (Q3391182) (← links)
• Solving Fused Penalty Estimation Problems via Block Splitting Algorithms (Q3391427) (← links)
• Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
• The Cyclic Block Conditional Gradient Method for Convex Optimization Problems (Q3449572) (← links)
• An accelerated randomized Kaczmarz algorithm (Q3450034) (← links)
• An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
• Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods (Q3456873) (← links)
• A proximal block minimization method of multipliers with a substitution procedure (Q3458819) (← links)
• Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
• Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints (Q3465237) (← links)
• Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
• (Q4558169) (← links)
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
• (Q4558559) (← links)
• Iterative positive thresholding algorithm for non-negative sparse optimization (Q4559400) (← links)
• Semi-stochastic coordinate descent (Q4594842) (← links)
• A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
• Batched Stochastic Gradient Descent with Weighted Sampling (Q4609808) (← links)
• Avoiding Communication in Primal and Dual Block Coordinate Descent Methods (Q4613501) (← links)
• Performance of Sine–Cosine Algorithm on Large-Scale Optimization Problems (Q4613894) (← links)
• Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (Q4636997) (← links)
• (Q4637005) (← links)
• On the complexity of parallel coordinate descent (Q4638927) (← links)
• Optimization Methods for Large-Scale Machine Learning (Q4641709) (← links)
• A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
• Distributed Learning with Sparse Communications by Identification (Q4959464) (← links)
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions (Q4967326) (← links)
• On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent (Q4969070) (← links)
• (Q4969198) (← links)
• Understanding large text corpora via sparse machine learning (Q4969899) (← links)
• Randomized Gradient Boosting Machine (Q4971024) (← links)
• On Adaptive Sketch-and-Project for Solving Linear Systems (Q4997841) (← links)
• (Q4998960) (← links)
• Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
• Control analysis and design via randomised coordinate polynomial minimisation (Q5027405) (← links)
• Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
• A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity (Q5031804) (← links)
• Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
• Efficient numerical methods to solve sparse linear equations with application to PageRank (Q5043846) (← links)
• (Q5053193) (← links)
• (Q5053271) (← links)
• On the Convergence of Stochastic Primal-Dual Hybrid Gradient (Q5081780) (← links)
• slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks (Q5095499) (← links)
• On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games (Q5108262) (← links)
• On the Efficiency of Random Permutation for ADMM and Coordinate Descent (Q5108265) (← links)
• Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems (Q5109274) (← links)
• Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
• Analyzing random permutations for cyclic coordinate descent (Q5113666) (← links)
• Convergence analysis of the Fast Subspace Descent method for convex optimization problems (Q5113667) (← links)
• Faster Kriging: Facing High-Dimensional Simulators (Q5130493) (← links)