Pages that link to "Item:Q4967326"

The following pages link to A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions (Q4967326):

Displaying 24 items.

• On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
• Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems (Q302250) (← links)
• An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems (Q1702597) (← links)
• Iterative regularization via dual diagonal descent (Q1703168) (← links)
• Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences (Q1704003) (← links)
• Accelerated alternating descent methods for Dykstra-like problems (Q1704007) (← links)
• Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems (Q1785469) (← links)
• Pseudo-linear convergence of an additive Schwarz method for dual total variation minimization (Q2033682) (← links)
• Crouzeix-Raviart approximation of the total variation on simplicial meshes (Q2203365) (← links)
• Approximating the total variation with finite differences or finite elements (Q2235783) (← links)
• Domain decomposition methods using dual conversion for the total variation minimization with \(L^1\) fidelity term (Q2420690) (← links)
• An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming (Q2805705) (← links)
• The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$ (Q2817843) (← links)
• Total Variation on a Tree (Q3188199) (← links)
• Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation (Q3379602) (← links)
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
• Modular proximal optimization for multidimensional total-variation regularization (Q4614088) (← links)
• Active-set Methods for Submodular Minimization Problems (Q4637060) (← 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)
• Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives (Q5231684) (← links)
• Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone (Q5242932) (← links)
• The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists (Q6046287) (← links)