Pages that link to "Item:Q1016411"

The following pages link to Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411):

Displaying 26 items.

• Bilateral exchange and competitive equilibrium (Q255173) (← links)
• Monotonicity and market equilibrium (Q330320) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
• On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
• Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems (Q679565) (← links)
• A flexible coordinate descent method (Q1639710) (← links)
• Blocks of coordinates, stochastic programming, and markets (Q1722745) (← links)
• Stochastic block-coordinate gradient projection algorithms for submodular maximization (Q1723100) (← links)
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
• On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
• Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
• An alternating maximization method for approximating the hump of the matrix exponential (Q2411640) (← links)
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
• Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
• A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization (Q2815509) (← links)
• A COMPRESSED SENSING FRAMEWORK OF FREQUENCY-SPARSE SIGNALS THROUGH CHAOTIC SYSTEM (Q2843590) (← links)
• Model Selection for Cox Models with Time-Varying Coefficients (Q2912333) (← links)
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
• Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941) (← links)
• Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
• Laplacian-based semi-supervised learning in multilayer hypergraphs by coordinate descent (Q6491346) (← links)