Adaptive algorithms for mirror descent in convex programming problems with Lipschitz constraints

The paper is devoted to new modifications of recently proposed adaptive methods of Mirror Descent for convex minimization problems in the case of several convex functional constraints. Methods for problems of two classes are considered. The first type of problems with Lipschitz-continuous objective...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2018-05
Hauptverfasser:	Stonyakin, Fedor S, Alkousa, Mohammad S, Stepanov, Alexey N, Barinov, Maxim A
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive algorithms Computational geometry Continuity (mathematics) Convexity Descent Mathematical programming Optimization Run time (computers)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!