Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization

From MaRDI portal
Publication:2910891

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




Related Items (26)

Generalized maximum entropy estimationA fast dual proximal-gradient method for separable convex optimization with linear coupled constraintsOn the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate AscentEfficient numerical methods for entropy-linear programming problemsCertification aspects of the fast gradient method for solving the dual of parametric convex programsGeneralizing the Optimized Gradient Method for Smooth Convex MinimizationFirst-order methods of smooth convex optimization with inexact oracleOptimal subgradient algorithms for large-scale convex optimization in simple domainsA Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networksDecentralized convex optimization on time-varying networks with application to Wasserstein barycentersAnother Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)A double smoothing technique for solving unconstrained nondifferentiable convex optimization problemsAugmented Lagrangian optimization under fixed-point arithmeticComplexity of first-order inexact Lagrangian and penalty methods for conic convex programmingAn adaptive primal-dual framework for nonsmooth convex minimizationPrimal-dual methods for solving infinite-dimensional gamesSmooth strongly convex interpolation and exact worst-case performance of first-order methodsSolving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)Adaptive smoothing algorithms for nonsmooth composite convex minimizationOn the acceleration of the double smoothing technique for unconstrained convex optimization problemsConvergence Analysis of Approximate Primal Solutions in Dual First-Order MethodsA dual approach for optimal algorithms in distributed optimization over networksA variable smoothing algorithm for solving convex optimization problemsA stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimizationSmoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex ProgramsExact Worst-Case Performance of First-Order Methods for Composite Convex Optimization


Uses Software



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