A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems
DOI10.1016/J.CAM.2022.115043zbMATH Open1514.65074OpenAlexW4313530910MaRDI QIDQ6157934FDOQ6157934
Authors: M. Wen, Yongqiang Zhang, Hai-Yang Li, 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
Recommendations
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Preconditioned three-operator splitting algorithm with applications to image restoration
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
Numerical mathematical programming methods (65K05) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Nonlinear total variation based noise removal algorithms
- Convex analysis and monotone operator theory in Hilbert spaces
- Title not available (Why is that?)
- An algorithm for total variation minimization and applications
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Proximity algorithms for image models: denoising
- A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
- Title not available (Why is that?)
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A unified primal-dual algorithm framework based on Bregman iteration
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Link-Length Minimization in Networks
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Preconditioned alternating projection algorithms for maximum \textit{a posteriori} ECT reconstruction
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Image super-resolution by TV-regularization and Bregman iteration
- An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Fast proximity-gradient algorithms for structured convex optimization problems
- A preconditioning technique for first-order primal-dual splitting method in convex optimization
- Improving “Fast Iterative Shrinkage-Thresholding Algorithm”: Faster, Smarter, and Greedier
Cited In (4)
- A nested primal-dual FISTA-like scheme for composite convex optimization problems
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Primal-dual decomposition by operator splitting and applications to image deblurring
This page was built for publication: A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157934)
