Pages that link to "Item:Q285921"

The following pages link to On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921):

Displaying 12 items.

• Accelerated alternating descent methods for Dykstra-like problems (Q1704007) (← links)
• Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights (Q1717220) (← links)
• Proximal alternating penalty algorithms for nonsmooth constrained convex optimization (Q1734766) (← links)
• A partially proximal linearized alternating minimization method for finding Dantzig selectors (Q1983897) (← links)
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
• A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions (Q2297652) (← links)
• Low patch-rank image decomposition using alternating minimization algorithms (Q3383205) (← links)
• Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model (Q5109282) (← links)
• RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION (Q5149918) (← links)
• Foundations of Gauge and Perspective Duality (Q5376451) (← links)