Smoothing techniques and difference of convex functions algorithms for image reconstructions
From MaRDI portal
Publication:5131820
DOI10.1080/02331934.2019.1648467zbMath1477.49023OpenAlexW2964920382MaRDI QIDQ5131820
Nguyen Mau Nam, Daniel Giles, Hoai An Le Thi, Nguyen Thai An
Publication date: 9 November 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1648467
Nonsmooth analysis (49J52) Fréchet and Gateaux differentiability in optimization (49J50) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (3)
Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions ⋮ Stochastic incremental mirror descent algorithms with Nesterov smoothing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A fast patch-dictionary method for whole image recovery
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Smoothing and First Order Methods: A Unified Framework
- Optimization and nonsmooth analysis
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
This page was built for publication: Smoothing techniques and difference of convex functions algorithms for image reconstructions
