Pages that link to "Item:Q461437"

The following pages link to A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437):

Displaying 30 items.

• Parallel coordinate descent methods for big data optimization (Q263212) (← links)
• Selective bi-coordinate variations for resource allocation type problems (Q301690) (← links)
• Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
• A flexible coordinate descent method (Q1639710) (← links)
• Blocks of coordinates, stochastic programming, and markets (Q1722745) (← links)
• Multi-label Lagrangian support vector machine with random block coordinate descent method (Q1750531) (← links)
• On the generally randomized extended Gauss-Seidel method (Q2058411) (← links)
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
• Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems (Q2419552) (← links)
• New method for solving Ivanov regularization-based support vector machine learning (Q2669598) (← links)
• Coordinate descent with arbitrary sampling I: algorithms and complexity^† (Q2829565) (← links)
• Coordinate descent with arbitrary sampling II: expected separable overapproximation (Q2829566) (← links)
• Separable approximations and decomposition methods for the augmented Lagrangian (Q2943840) (← 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)
• 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)
• (Q4558169) (← 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)
• Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks (Q4646540) (← links)
• Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• (Q5158544) (← links)
• Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems (Q5375972) (← links)
• Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping (Q5501199) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
• Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)