Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914878419107840 |
|---|---|
| author | Yao, Yao Lin, Qihang Yang, Tianbao |
| author_facet | Yao, Yao Lin, Qihang Yang, Tianbao |
| contents | This paper explores numerical methods for solving a convex differentiable semi-infinite program. We introduce a primal-dual gradient method which performs three updates iteratively: a momentum gradient ascend step to update the constraint parameters, a momentum gradient ascend step to update the dual variables, and a gradient descend step to update the primal variables. Our approach also extends to scenarios where gradients and function values are accessible solely through stochastic oracles. This method extends the recent primal-dual methods, for example, Hamedani and Aybat (2021); Boob et al. (2022), for optimization with a finite number of constraints. We show the iteration complexity of the proposed method for finding an $ε$-optimal solution under different convexity and concavity assumptions on the functions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_10993 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization Yao, Yao Lin, Qihang Yang, Tianbao Optimization and Control This paper explores numerical methods for solving a convex differentiable semi-infinite program. We introduce a primal-dual gradient method which performs three updates iteratively: a momentum gradient ascend step to update the constraint parameters, a momentum gradient ascend step to update the dual variables, and a gradient descend step to update the primal variables. Our approach also extends to scenarios where gradients and function values are accessible solely through stochastic oracles. This method extends the recent primal-dual methods, for example, Hamedani and Aybat (2021); Boob et al. (2022), for optimization with a finite number of constraints. We show the iteration complexity of the proposed method for finding an $ε$-optimal solution under different convexity and concavity assumptions on the functions. |
| title | Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2310.10993 |