Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
From MaRDI portal
Publication:3133230
DOI10.1007/978-3-319-44914-2_31zbMath1391.90471arXiv1605.02970OpenAlexW2963043933MaRDI QIDQ3133230
A. V. Chernov, Pavel Dvurechensky, Alexander V. Gasnikov
Publication date: 13 February 2018
Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.02970
Related Items (16)
On Numerical Estimates of Errors in Solving Convex Optimization Problems ⋮ Stochastic saddle-point optimization for the Wasserstein barycenter problem ⋮ Composite optimization for the resource allocation problem ⋮ Primal–dual accelerated gradient methods with small-dimensional relaxation oracle ⋮ Numerical methods for the resource allocation problem in a computer network ⋮ Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints ⋮ First-order methods for convex optimization ⋮ Alternating minimization methods for strongly convex optimization ⋮ An accelerated directional derivative method for smooth stochastic convex optimization ⋮ Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems ⋮ Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems ⋮ Universal method of searching for equilibria and stochastic equilibria in transportation networks ⋮ A dual approach for optimal algorithms in distributed optimization over networks ⋮ Inexact model: a framework for optimization and variational inequalities ⋮ Universal intermediate gradient method for convex problems with inexact oracle ⋮ Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
This page was built for publication: Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
