Адаптивные Алгоритмы Зеркального Спуска В Задачах Выпуклого Программирования С Липшицевыми Ограничениями

Стонякин, Федор Сергеевич; Алкуса, М. С.; Степанов, А. Н.; Баринов, М. А.

doi:10.21538/0134-4889-2018-24-2-266-279

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

2023

Publication Types

Select...

Book3

Article2

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Mirror Descent and Constrained Online Optimization Problems

Титов¹,

Stonyakin²,

Gasnikov

et al. 2019

Communications in Computer and Information Science

View full text Add to dashboard Cite

We consider the following class of online optimization problems with functional constraints. Assume, that a finite set of convex Lipschitz-continuous non-smooth functionals are given on a closed set of n-dimensional vector space. The problem is to minimize the arithmetic mean of functionals with a convex Lipschitz-continuous non-smooth constraint. In addition, it is allowed to calculate the (sub)gradient of each functional only once. Using some recently proposed adaptive methods of Mirror Descent the method is suggested to solve the mentioned constrained online optimization problem with optimal estimate of accuracy. For the corresponding non-Euclidean prox-structure the case of a set of n-dimensional vectors lying on the standard n-dimensional simplex is considered.

show abstract