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

DOI10.1007/S10915-016-0235-4zbMATH Open1369.90126OpenAlexW2410917795MaRDI QIDQ2399239FDOQ2399239

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

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

Recommendations

• A dual algorithm for a class of augmented convex signal recovery models
• Local linear convergence analysis of primal-dual splitting methods
• On the local quadratic convergence of the primal–dual augmented Lagrangian method
• Primal-dual proximal algorithms for structured convex optimization: a unifying framework
• On primal convergence for augmented Lagrangian duality

zbMATH Keywords

convex optimizationprimal-dual algorithmlocal linear convergenceaugmented convex modelpartial smoothness

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Cites Work

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

Cited In (3)

• An Augmented Primal-Dual Method for Linear Conic Programs
• On the local quadratic convergence of the primal–dual augmented Lagrangian method
• Local linear convergence analysis of Primal–Dual splitting methods

Uses Software

• PDCO

This page was built for publication: Local linear convergence of a primal-dual algorithm for the augmented convex models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399239)