237
Views
2
CrossRef citations to date
0
Altmetric
Articles

Smoothing techniques and difference of convex functions algorithms for image reconstructions

, , &
Pages 1601-1633 | Received 13 Oct 2018, Accepted 05 Jul 2019, Published online: 03 Aug 2019

References

  • Nesterov Y. Smooth minimization of non-smooth functions. Math Program Ser A. 2005;103:127–152. doi: 10.1007/s10107-004-0552-5
  • An LTH, Tao PD. DC programming and DCA: thirty years of developments. Math Program Special Issue. 2018;169(1):5–64.
  • Tao PD, An LTH. Convex analysis approach to D.C. Programming. 1997;22:289–355.
  • Tao PD, An LTH. A d.c. optimization algorithm for solving the trust-region subproblem. SIAM J Optim. 1998;8:476–505. doi: 10.1137/S1052623494274313
  • Xin J, Osher S, Lou Y. Computational aspects of L1–L2 minimization for compressive sensing. Adv Intell Syst Comput. 2015;359:169–180.
  • Yin P, Lou Y, He Q, et al. Minimization of L1–L2 for compressed sensing. SIAM J Sci Comput. 2015;37:A536–A563. doi: 10.1137/140952363
  • Clarke FH. Nonsmooth analysis and optimization. New York: John Wiley & Sons, Inc.; 1983.
  • Giles JR. A survey of Clarke's subdifferential and the differentiability of locally Lipschitz functions. In: Progress in optimization. applied optimization, Vol. 30, Boston, MA: Springer.
  • Mordukhovich BS. Variational analysis and generalized differentiation, I: basic theory, II: applications. Grundlehren series (Fundamental Principles of Mathematical Sciences), Vols. 330 and 331, Berlin: Springer; 2006.
  • Zălinescu C. Convex analysis in general vector spaces. Singapore: World Scientific; 2002.
  • Beck A, Teboulle M. Smoothing and first order methods: a unified framework. SIAM J Optim. 2012;22:557–580. doi: 10.1137/100818327
  • Vandenberghe L. Optimization methods for large-scale systems, EE236C lecture notes, UCLA.
  • Xu Y, Yin W. A fast patch dictionary method for whole image recovery. Inverse Probl Imaging. 2016;10:563–583. doi: 10.3934/ipi.2016012
  • Mordukhovich BS, Nam NM. An easy path to convex analysis and applications. San Rafael: Morgan & Claypool; 2014.
  • Aharon M, Elad M, Bruckstein A. K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans Signal Process. 2006;54:4311–4322. doi: 10.1109/TSP.2006.881199
  • Mairal J, Bach F, Ponce J, et al. Online dictionary learning for sparse coding. Proc. 26th Int'l Conf. Machine Learning. Montreal, Canada: 2009.
  • Xu Y, Yin W. A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J Imaging Sci. 2013;6:1758–1789. doi: 10.1137/120887795
  • Martin D, Fowlkes C, Tal D, et al. A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. Proc 8th Int'l Conf Comput Vision. 2001;2:416–423. doi: 10.1109/ICCV.2001.937655
  • Beck A, Teboulle M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci. 2009;2:183–202. doi: 10.1137/080716542

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.