Pages that link to "Item:Q4286937"

The following pages link to On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization (Q4286937):

Displaying 26 items.

• Subgradient methods for huge-scale optimization problems (Q403646) (← links)
• On the linear convergence of the alternating direction method of multipliers (Q517301) (← 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 coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
• Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
• Error bounds for inconsistent linear inequalities and programs (Q1342080) (← links)
• Error bounds in mathematical programming (Q1365060) (← links)
• A unified approach to error bounds for structured convex optimization problems (Q1675267) (← links)
• On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems (Q1689375) (← links)
• Convergence of the augmented decomposition algorithm (Q1734773) (← links)
• Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
• Nonconvex proximal incremental aggregated gradient method with linear convergence (Q2275279) (← links)
• Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
• Further properties of the forward-backward envelope with applications to difference-of-convex programming (Q2364125) (← links)
• Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
• A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization (Q2691343) (← links)
• An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
• Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
• Projection onto a Polyhedron that Exploits Sparsity (Q2817841) (← links)
• A sequential updating scheme of the Lagrange multiplier for separable convex programming (Q2826683) (← links)
• Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
• A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure (Q5086011) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)