default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPuya Latafat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Pourya Behmandpoor
, Puya Latafat, Andreas Themelis, Marc Moonen, Panagiotis Patrinos:
SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization. Comput. Optim. Appl. 88(1): 71-106 (2024)- [c9]Konstantinos A. Oikonomidis, Emanuel Laude, Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
Adaptive Proximal Gradient Methods Are Universal Without Approximation. ICML 2024 - [c8]Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms. L4DC 2024: 197-208 - [i7]Konstantinos A. Oikonomidis, Emanuel Laude, Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
Adaptive proximal gradient methods are universal without approximation. CoRR abs/2402.06271 (2024) - 2023
- [c7]Thomas Pethick, Olivier Fercoq, Puya Latafat, Panagiotis Patrinos, Volkan Cevher:
Solving stochastic weak Minty variational inequalities without increasing batch size. ICLR 2023 - [i6]Puya Latafat, Andreas Themelis, Lorenzo Stella, Panagiotis Patrinos:
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient. CoRR abs/2301.04431 (2023) - [i5]Thomas Pethick, Olivier Fercoq, Puya Latafat, Panagiotis Patrinos, Volkan Cevher:
Solving stochastic weak Minty variational inequalities without increasing batch size. CoRR abs/2302.09029 (2023) - [i4]Thomas Pethick, Puya Latafat, Panagiotis Patrinos, Olivier Fercoq, Volkan Cevher:
Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems. CoRR abs/2302.09831 (2023) - [i3]Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms. CoRR abs/2311.18431 (2023) - [i2]Brecht Evens, Puya Latafat, Panagiotis Patrinos:
Convergence of the Chambolle-Pock Algorithm in the Absence of Monotonicity. CoRR abs/2312.06540 (2023) - 2022
- [j5]Puya Latafat, Andreas Themelis, Panagiotis Patrinos:
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems. Math. Program. 193(1): 195-224 (2022) - [j4]Puya Latafat, Panagiotis Patrinos:
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays. Optim. Methods Softw. 37(6): 2052-2079 (2022) - [j3]Puya Latafat, Andreas Themelis, Masoud Ahookhosh, Panagiotis Patrinos:
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity. SIAM J. Optim. 32(3): 2230-2262 (2022) - [c6]Thomas Pethick, Puya Latafat, Panos Patrinos, Olivier Fercoq, Volkan Cevher:
Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems. ICLR 2022 - [i1]Pourya Behmandpoor, Puya Latafat, Andreas Themelis, Marc Moonen, Panagiotis Patrinos:
SPIRAL: A Superlinearly Convergent Incremental Proximal Algorithm for Nonconvex Finite Sum Minimization. CoRR abs/2207.08195 (2022) - 2021
- [c5]Brecht Evens, Puya Latafat, Andreas Themelis, Johan A. K. Suykens, Panagiotis Patrinos:
Neural Network Training as an Optimal Control Problem : - An Augmented Lagrangian Approach -. CDC 2021: 5136-5143
2010 – 2019
- 2019
- [j2]Puya Latafat, Nikolaos M. Freris, Panagiotis Patrinos:
A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization. IEEE Trans. Autom. Control. 64(10): 4050-4065 (2019) - 2018
- [c4]Puya Latafat, Panagiotis Patrinos:
Multi-agent structured optimization over message-passing architectures with bounded communication delays. CDC 2018: 1688-1693 - [c3]Puya Latafat, Alberto Bemporad, Panagiotis Patrinos:
Plug and Play Distributed Model Predictive Control with Dynamic Coupling: A Randomized Primal-Dual Proximal Algorithm. ECC 2018: 1160-1165 - 2017
- [j1]Puya Latafat, Panagiotis Patrinos:
Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators. Comput. Optim. Appl. 68(1): 57-93 (2017) - 2016
- [c2]Puya Latafat, Lorenzo Stella, Panagiotis Patrinos:
New primal-dual proximal algorithm for distributed optimization. CDC 2016: 1959-1964 - 2015
- [c1]Puya Latafat, Pasquale Palumbo, Pierdomenico Pepe, Levente Kovács, Simona Panunzi, Andrea De Gaetano:
An LMI-based controller for the glucose-insulin system. ECC 2015: 7-12
Coauthor Index
aka: Panos Patrinos
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 2024-10-16 21:24 CEST 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:
