Pages that link to "Item:Q5300539"

The following pages link to On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods (Q5300539):

Displaying 31 items.

• Parallel coordinate descent methods for big data optimization (Q263212) (← links)
• Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
• Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
• A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
• Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences (Q1704003) (← links)
• Convergence of incentive-driven dynamics in Fisher markets (Q2155906) (← links)
• Randomness and permutations in coordinate descent methods (Q2189444) (← links)
• Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
• Alternating minimization methods for strongly convex optimization (Q2232092) (← links)
• Parallel block coordinate minimization with application to group regularized regression (Q2358088) (← links)
• Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
• An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming (Q2805705) (← links)
• A knowledge‐supported improvement of the PSO method (Q2842720) (← links)
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
• Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← 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)
• Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
• On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization (Q4558510) (← links)
• On the complexity of parallel coordinate descent (Q4638927) (← links)
• Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems (Q5109274) (← links)
• ADDRESSING IMBALANCED INSURANCE DATA THROUGH ZERO-INFLATED POISSON REGRESSION WITH BOOSTING (Q5157763) (← links)
• Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization (Q5501228) (← links)
• Block-cyclic stochastic coordinate descent for deep neural networks (Q6054553) (← links)
• Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) (← links)
• On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
• (Q6188352) (← links)