A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions

DOI10.1186/s13663-016-0543-2zbMath1505.90094arXiv1512.09235OpenAlexW2220137601WikidataQ59467505 ScholiaQ59467505MaRDI QIDQ284904

Xiaoqun Zhang, Peijun Chen, Jian-Guo Huang

Publication date: 18 May 2016

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

convex separable minimizationprimal-dual fixed point algorithmproximity operatorsparsity regularization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (23)

A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement ⋮ Second order semi-smooth proximal Newton methods in Hilbert spaces ⋮ Proportional-integral projected gradient method for conic optimization ⋮ PET-MRI joint reconstruction with common edge weighted total variation regularization ⋮ Unified linear convergence of first-order primal-dual algorithms for saddle point problems ⋮ Preconditioned three-operator splitting algorithm with applications to image restoration ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting ⋮ Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application ⋮ A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems ⋮ Efficient representation of spatio-temporal data using cylindrical shearlets ⋮ Sparse dynamic tomography: a shearlet-based approach for iodine perfusion in plant stems ⋮ Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection ⋮ A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems ⋮ Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit ⋮ On starting and stopping criteria for nested primal-dual iterations ⋮ New convergence analysis of a primal-dual algorithm with large stepsizes ⋮ A new primal-dual algorithm for minimizing the sum of three functions with a linear operator ⋮ Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming ⋮ Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm ⋮ Constraint consensus based artificial bee colony algorithm for constrained optimization problems ⋮ Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates ⋮ Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration

Uses Software

• PULSAR

Cites Work

• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
• Preconditioned alternating projection algorithms for maximum a posteriori ECT reconstruction
• The Split Bregman Method for L1-Regularized Problems
• A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
• Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
• Sparsity and Smoothness Via the Fused Lasso
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• Model Selection and Estimation in Regression with Grouped Variables
• Signal Recovery by Proximal Forward-Backward Splitting
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions