Local linear convergence of a primal-dual algorithm for the augmented convex models

DOI10.1007/s10915-016-0235-4zbMath1369.90126MaRDI QIDQ2399239

Roberto Barrio, Tao Sun, Hao Jiang, Li-Zhi Cheng

Publication date: 22 August 2017

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10915-016-0235-4

zbMATH Keywords

convex optimization; primal-dual algorithm; local linear convergence; augmented convex model; partial smoothness

Mathematics Subject Classification ID

90C25: Convex programming

65K10: Numerical optimization and variational techniques

Related Items

Local linear convergence analysis of Primal–Dual splitting methods

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Fast linearized Bregman iteration for compressive sensing and sparse denoising
• Accelerated linearized Bregman method
• Proximity algorithms for the L1/TV image denoising model
• A dual algorithm for a class of augmented convex signal recovery models
• Low Complexity Regularization of Linear Inverse Problems
• Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
• Analysis and Generalizations of the Linearized Bregman Method
• A proximity algorithm accelerated by Gauss–Seidel iterations for L1/TV denoising models
• Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Exact Regularization of Convex Programs
• Atomic Decomposition by Basis Pursuit
• Variational Analysis
• Active Sets, Nonsmoothness, and Sensitivity
• Analysis versus synthesis in signal priors
• Alternating Projections on Manifolds
• Model Selection and Estimation in Regression with Grouped Variables
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Convex Analysis