Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
From MaRDI portal
Publication:2002421
DOI10.1007/s11045-018-0615-zzbMath1412.90116OpenAlexW2889647488MaRDI QIDQ2002421
Angang Cui, Meng Wen, Yu-Chao Tang, Ji-Gen Peng
Publication date: 12 July 2019
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11045-018-0615-z
Convex programming (90C25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- The composite absolute penalties family for grouped and hierarchical variable selection
- A novel approach for reducing attributes and its application to small enterprise financing ability evaluation
- A preconditioning technique for first-order primal-dual splitting method in convex optimization
- A splitting primal-dual proximity algorithm for solving composite optimization problems
- Proximity algorithms for image models: denoising
- Solving the split feasibility problem without prior knowledge of matrix norms
- Almost convergence of the infinite product of resolvents in Banach spaces
- 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
- Convex analysis and monotone operator theory in Hilbert spaces
