A dual algorithm for a class of augmented convex signal recovery models

DOI10.4310/CMS.2015.V13.N1.A5zbMath1321.65102arXiv1308.6337OpenAlexW2326589273MaRDI QIDQ2257625

Wotao Yin, Li-Zhi Cheng, Hui Zhang

Publication date: 25 February 2015

Published in: Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.6337

zbMATH Keywords

convergenceprimal-dual methodsignal recoverygaugeproximal operatoraugmented convex modelLagrange dual algorithm

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (5)

Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization ⋮ Revisiting linearized Bregman iterations under Lipschitz-like convexity condition ⋮ Local linear convergence of a primal-dual algorithm for the augmented convex models ⋮ Sparse sampling Kaczmarz–Motzkin method with linear convergence ⋮ New analysis of linear convergence of gradient-type methods via unifying error bound conditions

Uses Software

• PDCO

This page was built for publication: A dual algorithm for a class of augmented convex signal recovery models