An optimal algorithm for minimax problems with smooth components
In this paper, we propose an optimal algorithm for the convex minimax. This is an extension of the Nestrerov algorithm, which allows step size parameters to be non-constant and determined automatically during algorithm execution. We present the algorithm and prove the convergence of this algorithm w...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
The University of Danang
2024-06-01
|
| Seri Bilgileri: | Tạp chí Khoa học và Công nghệ |
| Konular: | |
| Online Erişim: | https://jst-ud.vn/jst-ud/article/view/9194 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|