Adaptive smoothing algorithms for nonsmooth composite convex minimization
type: Item
instance of: scholarly article
title: Adaptive smoothing algorithms for nonsmooth composite convex minimization
zbMATH Open document ID: 1366.90168
published in: Computational Optimization and Applications
publication date: 2017-04-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1509.00106
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 6706966
zbMATH Keywords: Nesterov's smoothing technique
zbMATH Keywords: accelerated proximal-gradient method
zbMATH Keywords: adaptive algorithm
zbMATH Keywords: composite convex minimization
zbMATH Keywords: nonsmooth convex optimization
author: Quoc Tran Dinh
describes a project that uses: NESTA
describes a project that uses: TFOCS
describes a project that uses: UNLocBoX
MaRDI profile type: Publication
OpenAlex ID: W2963925567
arXiv ID: 1509.00106
cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Smoothing and first order methods: a unified framework
cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
cites work: Templates for convex cone problems with applications to sparse signal recovery
cites work: Square-root lasso: pivotal recovery of sparse signals via conic programming
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Q4001523
cites work: A variable smoothing algorithm for solving convex optimization problems
cites work: A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs
cites work: Proximal Splitting Methods in Signal Processing
cites work: Double smoothing technique for large-scale linearly constrained convex optimization
cites work: Fast alternating linearization methods for minimizing the sum of two convex functions
cites work: Q5492525
cites work: Application of a Smoothing Technique to Decomposition in Convex Optimization
cites work: Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Excessive Gap Technique in Nonsmooth Convex Minimization
cites work: Smooth minimization of non-smooth functions
cites work: Smoothing technique and its applications in semidefinite optimization
cites work: Gradient methods for minimizing composite functions
cites work: Composite Self-Concordant Minimization
cites work: Q3712130
cites work: Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
DOI: 10.1007/S10589-016-9873-6
description: scientific article