Adaptive smoothing algorithms for nonsmooth composite convex minimization

DOI10.1007/s10589-016-9873-6zbMath1366.90168arXiv1509.00106OpenAlexW2963925567MaRDI QIDQ523569

Quoc Tran Dinh

Publication date: 21 April 2017

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.00106

zbMATH Keywords

adaptive algorithmnonsmooth convex optimizationaccelerated proximal-gradient methodcomposite convex minimizationNesterov's smoothing technique

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Identifying Heterogeneous Effect Using Latent Supervised Clustering With Adaptive Fusion, Riemannian smoothing gradient type algorithms for nonsmooth optimization problem on compact Riemannian submanifold embedded in Euclidean space, A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds, Stochastic incremental mirror descent algorithms with Nesterov smoothing, Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability, Proximal alternating penalty algorithms for nonsmooth constrained convex optimization, A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization, Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs

Uses Software

• NESTA
• UNLocBoX
• TFOCS

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• Gradient methods for minimizing composite functions
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Smoothing technique and its applications in semidefinite optimization
• Introductory lectures on convex optimization. A basic course.
• Templates for convex cone problems with applications to sparse signal recovery
• A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
• A variable smoothing algorithm for solving convex optimization problems
• Lectures on Modern Convex Optimization
• Proximal Splitting Methods in Signal Processing
• Smoothing and First Order Methods: A Unified Framework
• Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Square-root lasso: pivotal recovery of sparse signals via conic programming
• A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs
• Application of a Smoothing Technique to Decomposition in Convex Optimization
• Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC
• Excessive Gap Technique in Nonsmooth Convex Minimization
• Composite Self-Concordant Minimization
• Convex analysis and monotone operator theory in Hilbert spaces