Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems

DOI10.1016/j.orl.2015.11.007zbMath1408.90233OpenAlexW2184578012MaRDI QIDQ1785469

Yakov Vaisbourd, Amir Beck, Ariel Shemtov, Luba Tetruashvili

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.11.007

zbMATH Keywords

total variation denoisingblock variables decompositiondual based methods

Mathematics Subject Classification ID

Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Error bounds and convergence analysis of feasible descent methods: A general approach
• A fast dual proximal gradient algorithm for convex minimization and applications
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
• Globally convergent block-coordinate techniques for unconstrained optimization
• Variational Analysis
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• On the Convergence of Block Coordinate Descent Type Methods
• Signal Recovery by Proximal Forward-Backward Splitting
• Proximité et dualité dans un espace hilbertien
• Convex Analysis