Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
type: Item
instance of: scholarly article
title: Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
zbMATH Open document ID: 1380.49046
DOI: 10.1134/S0965542517080048
author: Anton S. Anikin
author: A. I. Tyurin
author: A. V. Chernov
author: Alexander V. Gasnikov
author: Pavel Dvurechensky
published in: Computational Mathematics and Mathematical Physics
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6816214
zbMATH Keywords: minimization of strongly convex functionals
zbMATH Keywords: primal-dual methods
zbMATH Keywords: fast gradient method
zbMATH Keywords: dual problem
zbMATH Keywords: regularization of dual problems
zbMATH Keywords: restart technique
zbMATH Keywords: strong convexity
zbMATH Keywords: PageRank problem
MaRDI profile type: Publication
cites work: Efficient numerical methods for entropy-linear programming problems
cites work: Primal-dual subgradient methods for convex problems
cites work: Accuracy Certificates for Computational Problems with Convex Structure
cites work: Complexity bounds for primal-dual methods minimizing the model of objective function
cites work: Q2969463
cites work: Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
cites work: Q3967357
cites work: Q3797760
cites work: Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Gradient methods for minimizing composite functions
cites work: Universal gradient methods for convex optimization problems
cites work: Stochastic intermediate gradient method for convex optimization problems
cites work: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
cites work: On efficient randomized algorithms for finding the PageRank vector
cites work: Q5558820
cites work: Universal method for stochastic composite optimization problems
cites work: Adaptive restart for accelerated gradient schemes
full work available at URL: s0965542517080048
OpenAlex ID: W2752013009
Recommended article: A general duality scheme for nonconvex minimization problems with a strict inequality constraint
Recommended article: On the strong concavity of the dual function of an optimization problem
Recommended article: Strong duality and minimal representations for cone optimization
Recommended article: On strong and total Lagrange duality for convex optimization problems
Recommended article: Strong duality for generalized convex optimization problems
Recommended article: Q4856877
Recommended article: Dual approach for a class of implicit convex optimization problems
Recommended article: Duality for almost convex optimization problems via the perturbation approach
Recommended article: A dual regularized method for solving a class of convex minimization problems
Recommended article: Strong Duality in Cone Constrained Nonconvex Optimization
description: scientific article; zbMATH DE number 6816214