Subgradient ellipsoid method for nonsmooth convex problems
From MaRDI portal
Publication:6038646
DOI10.1007/s10107-022-01833-4zbMath1518.90070arXiv2106.13340OpenAlexW3174574580MaRDI QIDQ6038646
Anton Rodomanov, Yu. E. Nesterov
Publication date: 2 May 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.13340
nonsmooth optimizationvariational inequalitiesconvex optimizationsubgradient methodsaddle-point problemsellipsoid methodaccuracy certificatesseparating oracle
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Minimax problems in mathematical programming (90C47)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- An optimal method for stochastic composite optimization
- Lectures on convex optimization
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- The ellipsoid method and its consequences in combinatorial optimization
- First-order and stochastic optimization methods for machine learning
- Lectures on Modern Convex Optimization
- Accuracy Certificates for Computational Problems with Convex Structure
- Robust Stochastic Approximation Approach to Stochastic Programming
- Feature Article—The Ellipsoid Method: A Survey
- Location of the Maximum on Unimodal Surfaces
- Brève communication. Résolution numérique d'inégalités variationnelles