Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization

DOI10.1137/110826102zbMath1257.90047OpenAlexW3121465269MaRDI QIDQ2910891

Olivier Devolder, François Glineur, Yu. E. Nesterov

Publication date: 12 September 2012

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d00fa443aaf2b90fda68d8f45e75eca45413ac7d

zbMATH Keywords

dual problemregularizationHilbert spaceoptimal control problemlinear constraintssmoothing techniquefast gradient methodinfinite-dimensional convex set

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (26)

Generalized maximum entropy estimation ⋮ A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints ⋮ On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent ⋮ Efficient numerical methods for entropy-linear programming problems ⋮ Certification aspects of the fast gradient method for solving the dual of parametric convex programs ⋮ Generalizing the Optimized Gradient Method for Smooth Convex Minimization ⋮ First-order methods of smooth convex optimization with inexact oracle ⋮ Optimal subgradient algorithms for large-scale convex optimization in simple domains ⋮ A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks ⋮ Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters ⋮ Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA) ⋮ A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems ⋮ Augmented Lagrangian optimization under fixed-point arithmetic ⋮ Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming ⋮ An adaptive primal-dual framework for nonsmooth convex minimization ⋮ Primal-dual methods for solving infinite-dimensional games ⋮ Smooth strongly convex interpolation and exact worst-case performance of first-order methods ⋮ Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization ⋮ On the acceleration of the double smoothing technique for unconstrained convex optimization problems ⋮ Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods ⋮ A dual approach for optimal algorithms in distributed optimization over networks ⋮ A variable smoothing algorithm for solving convex optimization problems ⋮ 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 ⋮ Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization

Uses Software

• TFOCS

This page was built for publication: Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization