Pages that link to "Item:Q2813610"

The following pages link to A fast dual gradient method for separable convex optimization via smoothing (Q2813610):

Displaying 9 items.

• An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
• Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems (Q1078076) (← links)
• A fast dual proximal gradient algorithm for convex minimization and applications (Q1667162) (← links)
• On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems (Q1689375) (← links)
• Dualize, split, randomize: toward fast nonsmooth optimization algorithms (Q2082232) (← links)
• Path-following gradient-based decomposition algorithms for separable convex optimization (Q2249817) (← links)
• Double smoothing technique for large-scale linearly constrained convex optimization (Q2910891) (← links)
• Faster <i>p</i>-norm minimizing flows, via smoothed <i>q</i>-norm problems (Q5146825) (← links)