A variable smoothing algorithm for solving convex optimization problems
From MaRDI portal
Publication:2343070
DOI10.1007/s11750-014-0326-zzbMath1317.90233arXiv1207.3254MaRDI QIDQ2343070
Radu Ioan Boţ, Christopher Hendrich
Publication date: 4 May 2015
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.3254
90C25: Convex programming
90C46: Optimality conditions and duality in mathematical programming
47A52: Linear operators and ill-posed problems, regularization
Related Items
A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization, Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming, Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs, A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds, 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, Solving monotone inclusions involving parallel sums of linearly composed maximally monotone operators, Adaptive smoothing algorithms for nonsmooth composite convex minimization, Dynamic smoothness parameter for fast gradient methods, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Variable smoothing for weakly convex composite functions, Variable smoothing for convex optimization problems using stochastic gradients, An adaptive primal-dual framework for nonsmooth convex minimization
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Optimization problems in statistical learning: duality and optimality conditions
- Smoothing technique and its applications in semidefinite optimization
- Conjugate duality in convex optimization
- Introductory lectures on convex optimization. A basic course.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Employing different loss functions for the classification of images via supervised learning
- From Hahn--Banach to monotonicity
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Smoothing and First Order Methods: A Unified Framework
- Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- On Extension of Fenchel Duality and its Application
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Variational Bayesian Image Restoration Based on a Product of $t$-Distributions Image Prior
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- Signal Recovery by Proximal Forward-Backward Splitting
- Proximité et dualité dans un espace hilbertien
- Convex analysis and monotone operator theory in Hilbert spaces
