A modified primal-dual method with applications to some sparse recovery problems

DOI10.1016/J.AMC.2018.03.089zbMath1427.90225OpenAlexW2797655364MaRDI QIDQ2335126

Yongchao Yu, Ji-Gen Peng

Publication date: 13 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.03.089

zbMATH Keywords

primal-dual methodproximity operatorsparse recovery problems

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Related Items (1)

Convergence analysis of an inexact three-operator splitting algorithm

Uses Software

• PDCO

Cites Work

• 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
• An improved first-order primal-dual algorithm with a new correction step
• A primal-dual prediction-correction algorithm for saddle point optimization
• Block splitting for distributed optimization
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Exact matrix completion via convex optimization
• Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• A remark on global positioning from local distances
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Decoding by Linear Programming
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Atomic Decomposition by Basis Pursuit
• Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
• The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
• On the Convergence of Primal-Dual Hybrid Gradient Algorithm
• A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators
• Signal Recovery by Proximal Forward-Backward Splitting
• Stable signal recovery from incomplete and inaccurate measurements
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A modified primal-dual method with applications to some sparse recovery problems