activity
20232025
most citedAccelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems

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

collaborators
Showing 2023Show all

1 paper · 1 filter

math.OC2023

Subgradient methods with variants of Polyak step-size for quasi-convex optimization with inequality constraints for analogues of sharp minima

S. M. Puchinin, E. R. Korolkov, F. S. Stonyakin +2

In this paper, we consider two variants of the concept of sharp minimum for mathematical programming problems with quasiconvex objective function and inequality constraints. It inv…