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...
সংরক্ষণ করুন:
| প্রধান লেখক: | , |
|---|---|
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
The University of Danang
2024-06-01
|
| মালা: | Tạp chí Khoa học và Công nghệ |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://jst-ud.vn/jst-ud/article/view/9194 |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|