Abstract
We introduce and analyze a new family of first-order optimization algorithms which generalizes and unifies both mirror descent and dual averaging. Within the framework of this family, we define new algorithms for constrained optimization that combines the advantages of mirror descent and dual averaging. Our preliminary simulation study shows that these new algorithms significantly outperform available methods in some situations.
| Original language | English |
|---|---|
| Pages (from-to) | 793-830 |
| Number of pages | 38 |
| Journal | Mathematical Programming |
| Volume | 199 |
| Issue number | 1-2 |
| DOIs | |
| Publication status | Published - 1 May 2023 |
Fingerprint
Dive into the research topics of 'Unifying mirror descent and dual averaging'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver