Algorithm based on primal-dual splitting method for solving a class of constrained separable convex optimization problem and its application

DOI10.3969/J.ISSN.1005-3085.2017.06.004MaRDI QIDQ4574568zbMATH OpenFDO

Authors Bao Chen, Chuanxi Zhu, H. Yu, Yu-Chao Tang

Publication date 18 July 2018

Full work available at URL https://doi.org/10.3969/J.ISSN.1005-3085.2017.06.004

zbMATH Keywords

image reconstructionprimal-dual splitting methodproximity operatorseparable convex programs

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• A primal-dual fixed point algorithm based on proximity operator for convex set constrained separable problems
• Preconditioned three-operator splitting algorithm with applications to image restoration
• Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
• A first-order splitting method for solving a large-scale composite convex optimization problem

Cited in

(7)

• A splitting primal-dual proximity algorithm for solving composite optimization problems
• Distributed and consensus optimization for non-smooth image reconstruction
• scientific article; zbMATH DE number 4145673 (Why is no real title available?)
• An extended primal-dual algorithm framework for nonconvex problems: application to image reconstruction in spectral CT
• A primal-dual fixed point algorithm based on proximity operator for convex set constrained separable problems
• A first-order splitting method for solving a large-scale composite convex optimization problem
• A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems

This page was built for publication: Algorithm based on primal-dual splitting method for solving a class of constrained separable convex optimization problem and its application

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