A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
From MaRDI portal
Abstract: The aim of this paper is to develop an efficient algorithm for solving a class of unconstrained nondifferentiable convex optimization problems in finite dimensional spaces. To this end we formulate first its Fenchel dual problem and regularize it in two steps into a differentiable strongly convex one with Lipschitz continuous gradient. The doubly regularized dual problem is then solved via a fast gradient method with the aim of accelerating the resulting convergence scheme. The theoretical results are finally applied to an l1 regularization problem arising in image processing.
Recommendations
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems
- scientific article; zbMATH DE number 4119957
- Double smoothing technique for large-scale linearly constrained convex optimization
- A smooth method for solving non-smooth unconstrained optimization problems
- On a new smoothing technique for non-smooth, non-convex optimization
- scientific article; zbMATH DE number 7165389
- Smoothing methods for nonsmooth, nonconvex minimization
- Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
- Nondifferentiable optimization by smooth approximations
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A monotone+skew splitting model for composite monotone inclusions in duality
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Conjugate duality in convex optimization
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Double smoothing technique for large-scale linearly constrained convex optimization
- Duality in Vector Optimization
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Gradient-based algorithms with applications to signal-recovery problems
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- 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.
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Smooth minimization of non-smooth functions
- Smoothing technique and its applications in semidefinite optimization
Cited in
(18)- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Proximal primal-dual best approximation algorithm with memory
- Variable smoothing for convex optimization problems using stochastic gradients
- An adaptive primal-dual framework for nonsmooth convex minimization
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- Random minibatch subgradient algorithms for convex problems with functional constraints
- A variable smoothing algorithm for solving convex optimization problems
- A Lagrange duality approach for multi-composed optimization problems
- Double smoothing technique for large-scale linearly constrained convex optimization
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators
- Dual bounds in convex and nonconvex nondifferentiable optimization problems and applications
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems
- Smoothing techniques and difference of convex functions algorithms for image reconstructions
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs
- The CoMirror algorithm for solving nonsmooth constrained convex problems
This page was built for publication: A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946618)
