Subgradient Ellipsoid Method for Nonsmooth Convex Problems
Optimization and Control
2021-06-28 v1
Abstract
In this paper, we present a new ellipsoid-type algorithm for solving nonsmooth problems with convex structure. Examples of such problems include nonsmooth convex minimization problems, convex-concave saddle-point problems and variational inequalities with monotone operator. Our algorithm can be seen as a combination of the standard Subgradient and Ellipsoid methods. However, in contrast to the latter one, the proposed method has a reasonable convergence rate even when the dimensionality of the problem is sufficiently large. For generating accuracy certificates in our algorithm, we propose an efficient technique, which ameliorates the previously known recipes.
Cite
@article{arxiv.2106.13340,
title = {Subgradient Ellipsoid Method for Nonsmooth Convex Problems},
author = {Anton Rodomanov and Yurii Nesterov},
journal= {arXiv preprint arXiv:2106.13340},
year = {2021}
}