activity
20202026
most citedSubgradient methods for non-smooth optimization problems with some relaxation of sharp minimum

1 citations · 2 across the 7 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

math.OC2020

Analogues of Switching Subgradient Schemes for Relatively Lipschitz-Continuous Convex Programming Problems

Alexander Titov, Fedor Stonyakin, Mohammad Alkousa +2

Recently some specific classes of non-smooth and non-Lipschitz convex optimization problems were selected by Yu.~Nesterov along with H.~Lu. We consider convex programming problems…