Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems

DOI10.3934/NACO.2015.5.79MaRDI QIDQ2340166zbMATH OpenOpenAlexFDO

Authors Sanming Liu, Zhijie Wang, Chongyang Liu

Publication date 16 April 2015

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/naco.2015.5.79

zbMATH Keywords

accelerated proximal-gradient methodsGaussian smoothingnonsmooth convex optimizationsmoothing method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• Adaptive smoothing algorithms for nonsmooth composite convex minimization
• A variable smoothing algorithm for solving convex optimization problems
• Smoothing methods for nonsmooth, nonconvex minimization
• Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces
• Efficient online and batch learning using forward backward splitting
• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• Introductory lectures on convex optimization. A basic course.
• Model selection and estimation in the Gaussian graphical model
• Robust principal component analysis?
• Smooth minimization of non-smooth functions

Cited in

(9)

• Variable smoothing for weakly convex composite functions
• Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
• Variable smoothing for convex optimization problems using stochastic gradients
• On the proximal Landweber Newton method for a class of nonsmooth convex problems
• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
• Adaptive smoothing algorithms for nonsmooth composite convex minimization
• Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator
• Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
• Smoothing methods for nonsmooth, nonconvex minimization

This page was built for publication: Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340166)