Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
From MaRDI portal
Publication:1683173
DOI10.1134/S0965542517080048zbMath1380.49046OpenAlexW2752013009MaRDI QIDQ1683173
A. V. Chernov, A. I. Tyurin, Anton S. Anikin, Alexander V. Gasnikov, Pavel Dvurechensky
Publication date: 6 December 2017
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542517080048
dual problemstrong convexityfast gradient methodprimal-dual methodsPageRank problemminimization of strongly convex functionalsregularization of dual problemsrestart technique
Related Items (18)
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 ⋮ Numerical methods for the resource allocation problem in a computer network ⋮ Primal-dual mirror descent method for constraint stochastic optimization problems ⋮ First-order methods for convex optimization ⋮ Recent theoretical advances in decentralized distributed convex optimization ⋮ A universal modification of the linear coupling method ⋮ Alternating minimization methods for strongly convex optimization ⋮ Universal method for stochastic composite optimization problems ⋮ Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks ⋮ Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point ⋮ An accelerated directional derivative method for smooth stochastic convex optimization ⋮ Decentralized and parallel primal and dual accelerated methods for stochastic convex programming 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
Cites Work
- Primal-dual subgradient methods for convex problems
- Efficient numerical methods for entropy-linear programming problems
- Gradient methods for minimizing composite functions
- Universal gradient methods for convex optimization problems
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Universal method for stochastic composite optimization problems
- Complexity bounds for primal-dual methods minimizing the model of objective function
- On efficient randomized algorithms for finding the PageRank vector
- Adaptive restart for accelerated gradient schemes
- Stochastic intermediate gradient method for convex optimization problems
- Lectures on Modern Convex Optimization
- Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
- Accuracy Certificates for Computational Problems with Convex Structure
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
