A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems
From MaRDI portal
Publication:6157934
DOI10.1016/j.cam.2022.115043zbMath1514.65074OpenAlexW4313530910MaRDI QIDQ6157934
Yong-Qiang Zhang, Hai-yang Li, Meng Wen, Yu-Chao Tang, Ji-Gen Peng
Publication date: 22 June 2023
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2022.115043
Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Image super-resolution by TV-regularization and Bregman iteration
- A unified primal-dual algorithm framework based on Bregman iteration
- Fast proximity-gradient algorithms for structured convex optimization problems
- An algorithm for total variation minimization and applications
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A preconditioning technique for first-order primal-dual splitting method in convex optimization
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI
- Proximity algorithms for image models: denoising
- 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
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier
- Link-Length Minimization in Networks
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems