default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmet Alacaoglu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Ahmet Alacaoglu, Stephen J. Wright:
Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints. AISTATS 2024: 4627-4635- [c12]Xufeng Cai, Ahmet Alacaoglu, Jelena Diakonikolas:
Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions. ICLR 2024 - [c11]Ahmet Alacaoglu, Donghwan Kim, Stephen J. Wright:
Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity. ICML 2024 - [i11]Ahmet Alacaoglu, Donghwan Kim, Stephen J. Wright:
Extending the Reach of First-Order Algorithms for Nonconvex Min-Max Problems with Cohypomonotonicity. CoRR abs/2402.05071 (2024) - 2023
- [j4]Ahmet Alacaoglu, Axel Böhm, Yura Malitsky:
Beyond the Golden Ratio for Variational Inequality Algorithms. J. Mach. Learn. Res. 24: 172:1-172:33 (2023) - [c10]Ahmet Alacaoglu, Hanbaek Lyu:
Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Data. ICML 2023: 458-489 - [i10]Xufeng Cai, Ahmet Alacaoglu, Jelena Diakonikolas:
Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusions. CoRR abs/2310.02987 (2023) - [i9]Ahmet Alacaoglu, Stephen J. Wright:
Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints. CoRR abs/2311.00678 (2023) - 2022
- [j3]Ahmet Alacaoglu, Olivier Fercoq
, Volkan Cevher:
On the Convergence of Stochastic Primal-Dual Hybrid Gradient. SIAM J. Optim. 32(2): 1288-1318 (2022) - [c9]Ahmet Alacaoglu, Yura Malitsky:
Stochastic Variance Reduction for Variational Inequality Methods. COLT 2022: 778-816 - [c8]Ahmet Alacaoglu, Luca Viano, Niao He, Volkan Cevher:
A Natural Actor-Critic Framework for Zero-Sum Markov Games. ICML 2022: 307-366 - [i8]Ahmet Alacaoglu, Volkan Cevher, Stephen J. Wright:
On the Complexity of a Practical Primal-Dual Coordinate Method. CoRR abs/2201.07684 (2022) - [i7]Ahmet Alacaoglu, Hanbaek Lyu:
Convergence and Complexity of Stochastic Subgradient Methods with Dependent Data for Nonconvex Optimization. CoRR abs/2203.15797 (2022) - [i6]Ahmet Alacaoglu, Axel Böhm, Yura Malitsky:
Beyond the Golden Ratio for Variational Inequality Algorithms. CoRR abs/2212.13955 (2022) - 2021
- [b1]Ahmet Alacaoglu:
Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond. EPFL, Switzerland, 2021 - [j2]Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher:
Forward-reflected-backward method with variance reduction. Comput. Optim. Appl. 80(2): 321-346 (2021) - [c7]Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher:
Convergence of adaptive algorithms for constrained weakly convex optimization. NeurIPS 2021: 14214-14225 - [i5]Ahmet Alacaoglu, Yura Malitsky:
Stochastic Variance Reduction for Variational Inequality Methods. CoRR abs/2102.08352 (2021) - 2020
- [j1]Quoc Tran-Dinh, Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher:
An adaptive primal-dual framework for nonsmooth convex minimization. Math. Program. Comput. 12(3): 451-491 (2020) - [c6]Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher:
Random extrapolation for primal-dual coordinate descent. ICML 2020: 191-201 - [c5]Ahmet Alacaoglu, Yura Malitsky, Panayotis Mertikopoulos, Volkan Cevher:
A new regret analysis for Adam-type algorithms. ICML 2020: 202-210 - [c4]Maria-Luiza Vladarean, Ahmet Alacaoglu, Ya-Ping Hsieh, Volkan Cevher:
Conditional gradient methods for stochastically constrained convex minimization. ICML 2020: 9775-9785 - [i4]Ahmet Alacaoglu, Yura Malitsky, Panayotis Mertikopoulos, Volkan Cevher:
A new regret analysis for Adam-type algorithms. CoRR abs/2003.09729 (2020) - [i3]Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher:
Convergence of adaptive algorithms for weakly convex constrained optimization. CoRR abs/2006.06650 (2020) - [i2]Maria-Luiza Vladarean, Ahmet Alacaoglu, Ya-Ping Hsieh, Volkan Cevher:
Conditional gradient methods for stochastically constrained convex minimization. CoRR abs/2007.03795 (2020) - [i1]Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher:
Random extrapolation for primal-dual coordinate descent. CoRR abs/2007.06528 (2020)
2010 – 2019
- 2019
- [c3]Olivier Fercoq, Ahmet Alacaoglu, Ion Necoara, Volkan Cevher:
Almost surely constrained convex optimization. ICML 2019: 1910-1919 - [c2]Mehmet Fatih Sahin, Armin Eftekhari, Ahmet Alacaoglu, Fabian Latorre, Volkan Cevher:
An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints. NeurIPS 2019: 13943-13955 - 2017
- [c1]Ahmet Alacaoglu, Quoc Tran-Dinh, Olivier Fercoq, Volkan Cevher:
Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization. NIPS 2017: 5852-5861
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
