Inexact relative smoothness and strong convexity for optimization and variational inequalities by inexact model
dc.bibliographicCitation.seriesTitle | WIAS Preprints | eng |
dc.bibliographicCitation.volume | 2709 | |
dc.contributor.author | Stonyakin, Fedor | |
dc.contributor.author | Gasnikov, Alexander | |
dc.contributor.author | Tyurin, Alexander | |
dc.contributor.author | Pasechnyuk, Dmitry | |
dc.contributor.author | Agafonov, Artem | |
dc.contributor.author | Dvurechensky, Pavel | |
dc.contributor.author | Dvinskikh, Darina | |
dc.contributor.author | Artamonov, Sergei | |
dc.contributor.author | Piskunova, Victorya | |
dc.date.accessioned | 2022-06-30T12:54:13Z | |
dc.date.available | 2022-06-30T12:54:13Z | |
dc.date.issued | 2020 | |
dc.description.abstract | In this paper we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems and variational inequalities. This framework allows to obtain many known methods as a special case, the list including accelerated gradient method, composite optimization methods, level-set methods, Bregman proximal methods. The idea of the framework is based on constructing an inexact model of the main problem component, i.e. objective function in optimization or operator in variational inequalities. Besides reproducing known results, our framework allows to construct new methods, which we illustrate by constructing a universal conditional gradient method and universal method for variational inequalities with composite structure. These method works for smooth and non-smooth problems with optimal complexity without a priori knowledge of the problem smoothness. As a particular case of our general framework, we introduce relative smoothness for operators and propose an algorithm for VIs with such operator. We also generalize our framework for relatively strongly convex objectives and strongly monotone variational inequalities. | eng |
dc.description.version | publishedVersion | eng |
dc.identifier.uri | https://oa.tib.eu/renate/handle/123456789/9359 | |
dc.identifier.uri | https://doi.org/10.34657/8397 | |
dc.language.iso | eng | |
dc.publisher | Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik | |
dc.relation.doi | https://doi.org/10.20347/WIAS.PREPRINT.2709 | |
dc.relation.issn | 2198-5855 | |
dc.rights.license | This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties. | eng |
dc.rights.license | Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden. | ger |
dc.subject.ddc | 510 | |
dc.subject.other | Convex optimization | eng |
dc.subject.other | composite optimization | eng |
dc.subject.other | proximal method | eng |
dc.subject.other | level-set method | eng |
dc.subject.other | variational inequality | eng |
dc.subject.other | universal method | eng |
dc.subject.other | mirror prox | eng |
dc.subject.other | acceleration | eng |
dc.subject.other | relative smoothness | eng |
dc.subject.other | saddle-point problem | eng |
dc.title | Inexact relative smoothness and strong convexity for optimization and variational inequalities by inexact model | eng |
dc.type | Report | eng |
dc.type | Text | eng |
dcterms.extent | 31 S. | |
tib.accessRights | openAccess | |
wgl.contributor | WIAS | |
wgl.subject | Mathematik | |
wgl.type | Report / Forschungsbericht / Arbeitspapier |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- wias_preprints_2709.pdf
- Size:
- 370.69 KB
- Format:
- Adobe Portable Document Format
- Description: