New proximal type algorithms for convex minimization and its application to image deblurring
From MaRDI portal
Publication:2085035
Recommendations
- New inertial forward-backward algorithm for convex minimization with applications
- Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring
- Iiduka type algorithms for minimization problems in finite dimensional Hilbert spaces with applications in the image deblurring problem
- A fast viscosity forward-backward algorithm for convex minimization problems with an application in image recovery
- Algorithms for zeros of two accretive operators for solving convex minimization problems and its application to image restoration problems
Cites work
- scientific article; zbMATH DE number 1785766 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A multiprojection algorithm using Bregman projections in a product space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An accelerated viscosity forward-backward splitting algorithm with the linesearch process for convex minimization problems
- An extragradient method for solving split feasibility and fixed point problems
- An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces
- Convergence of a splitting inertial proximal method for monotone operators
- Convex analysis and monotone operator theory in Hilbert spaces
- Entropy-Like Proximal Methods in Convex Programming
- Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier
- Iterative method with inertial for variational inequalities in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- On the convergence of the forward-backward splitting method with linesearches
- Set-valued mappings and enlargement of monotone operators.
- Solving the split feasibility problem without prior knowledge of matrix norms
- Split feasibility and fixed point problems
- The relaxed CQ algorithm solving the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
Cited in
(8)- Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem
- New inertial forward-backward algorithm for convex minimization with applications
- A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery
- Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring
- A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring
- Inertial self-adaptive algorithms for solving non-smooth convex optimization problems
- A modified inertial projected forward-backward algorithm for convex optimization problems
- Iiduka type algorithms for minimization problems in finite dimensional Hilbert spaces with applications in the image deblurring problem
This page was built for publication: New proximal type algorithms for convex minimization and its application to image deblurring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2085035)
