Pages that link to "Item:Q526831"

The following pages link to Iteration complexity analysis of block coordinate descent methods (Q526831):

Displaying 33 items.

• On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
• On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
• A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
• Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
• Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
• An accelerated coordinate gradient descent algorithm for non-separable composite optimization (Q2139254) (← links)
• Synchronous parallel block coordinate descent method for nonsmooth convex function minimization (Q2200102) (← 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)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
• On the convergence of asynchronous parallel iteration with unbounded delays (Q2422607) (← links)
• A parallel line search subspace correction method for composite convex optimization (Q2516372) (← 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)
• An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← 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)
• A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
• Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (Q4609466) (← links)
• A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions (Q4646445) (← links)
• (Q5149233) (← links)
• CoordinateWise Descent Methods for Leading Eigenvalue Problem (Q5230665) (← links)
• Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← 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)
• Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization (Q5501228) (← links)
• Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (Q5869813) (← links)
• Cyclic Coordinate Dual Averaging with Extrapolation (Q6060151) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)