Pages that link to "Item:Q5408210"

The following pages link to On the Convergence of Block Coordinate Descent Type Methods (Q5408210):

Displaying 50 items.

• Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
• A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
• Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs (Q2665379) (← links)
• A spatial Pareto exchange economy problem (Q2694473) (← links)
• An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming (Q2805705) (← links)
• Coordinate descent with arbitrary sampling II: expected separable overapproximation (Q2829566) (← links)
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
• Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← links)
• Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization (Q2954396) (← links)
• MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization (Q3179624) (← links)
• A Randomized Coordinate Descent Method with Volume Sampling (Q3300772) (← links)
• Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation (Q3379602) (← links)
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
• The Cyclic Block Conditional Gradient Method for Convex Optimization Problems (Q3449572) (← links)
• An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
• Decomposition Methods for Sparse Matrix Nearness Problems (Q3456880) (← links)
• A proximal block minimization method of multipliers with a substitution procedure (Q3458819) (← links)
• Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
• On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization (Q4558510) (← links)
• Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting (Q4624929) (← links)
• A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions (Q4967326) (← links)
• (Q4969198) (← links)
• Randomized Gradient Boosting Machine (Q4971024) (← links)
• (Q4998931) (← links)
• Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
• Newton-type multilevel optimization method (Q5038170) (← links)
• (Q5053277) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• On the Linear Convergence of the Multimarginal Sinkhorn Algorithm (Q5080502) (← links)
• slimTrain---A Stochastic Approximation Method for Training Separable Deep Neural Networks (Q5095499) (← 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)
• Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model (Q5109282) (← links)
• Additive Schwarz Methods for Convex Optimization as Gradient Methods (Q5110553) (← links)
• Analyzing random permutations for cyclic coordinate descent (Q5113666) (← links)
• Convergence analysis of the Fast Subspace Descent method for convex optimization problems (Q5113667) (← links)
• Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms (Q5144778) (← links)
• The Analysis of Alternating Minimization Method for Double Sparsity Constrained Optimization Problem (Q5149516) (← links)
• (Q5155916) (← links)
• (Q5159402) (← links)
• Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems (Q5231698) (← links)
• Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme (Q5236622) (← links)
• An alternating minimization method for robust principal component analysis (Q5238069) (← links)
• Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
• Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning (Q5254990) (← links)
• Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications (Q5348257) (← links)
• Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)
• Regularization of inverse problems via time discrete geodesics in image spaces (Q5383306) (← links)