default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErfan Yazdandoost Hamedani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Md Habibor Rahman
, Erfan Yazdandoost Hamedani, Young-Jun Son, Mohammed Shafae:
Taxonomy-Driven Graph-Theoretic Framework for Manufacturing Cybersecurity Risk Modeling and Assessment. J. Comput. Inf. Sci. Eng. 24(7) (2024)- [j5]Kevin Immanuel Gubbi, Banafsheh Saber Latibari, Muhtasim Alam Chowdhury, Afrooz Jalilzadeh, Erfan Yazdandoost Hamedani, Setareh Rafatirad, Avesta Sasan, Houman Homayoun, Soheil Salehi:
Optimized and Automated Secure IC Design Flow: A Defense-in-Depth Approach. IEEE Trans. Circuits Syst. I Regul. Pap. 71(5): 2031-2044 (2024) - [i3]Jincheng Cao, Ruichen Jiang, Erfan Yazdandoost Hamedani, Aryan Mokhtari:
An Accelerated Gradient Method for Simple Bilevel Optimization with Convex Lower-level Problem. CoRR abs/2402.08097 (2024) - 2023
- [j4]Erfan Yazdandoost Hamedani, Afrooz Jalilzadeh:
A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems. Comput. Optim. Appl. 85(2): 653-679 (2023) - [c9]Ruichen Jiang, Nazanin Abolfazli, Aryan Mokhtari, Erfan Yazdandoost Hamedani:
A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem. AISTATS 2023: 10305-10323 - [c8]Erfan Yazdandoost Hamedani, Afrooz Jalilzadeh, Necdet S. Aybat:
Randomized Primal-Dual Methods with Adaptive Step Sizes. AISTATS 2023: 11185-11212 - [c7]Nazanin Abolfazli, Afrooz Jalilzadeh, Erfan Yazdandoost Hamedani:
An Accelerated Asynchronous Distributed Method for Convex Constrained Optimization Problems. CISS 2023: 1-6 - [c6]Morteza Boroun, Erfan Yazdandoost Hamedani, Afrooz Jalilzadeh:
Projection-Free Methods for Solving Nonconvex-Concave Saddle Point Problems. NeurIPS 2023 - [c5]Jincheng Cao, Ruichen Jiang, Nazanin Abolfazli, Erfan Yazdandoost Hamedani, Aryan Mokhtari:
Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem. NeurIPS 2023 - [i2]Jincheng Cao, Ruichen Jiang, Nazanin Abolfazli, Erfan Yazdandoost Hamedani, Aryan Mokhtari:
Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problem. CoRR abs/2308.07536 (2023) - 2022
- [j3]Erfan Yazdandoost Hamedani, Necdet Serhat Aybat:
A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function. IEEE Trans. Autom. Control. 67(11): 5682-5697 (2022) - [i1]Ruichen Jiang, Nazanin Abolfazli, Aryan Mokhtari, Erfan Yazdandoost Hamedani:
Generalized Frank-Wolfe Algorithm for Bilevel Optimization. CoRR abs/2206.08868 (2022) - 2021
- [j2]Erfan Yazdandoost Hamedani, Necdet Serhat Aybat:
A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems. SIAM J. Optim. 31(2): 1299-1329 (2021)
2010 – 2019
- 2019
- [j1]Necdet Serhat Aybat, Erfan Yazdandoost Hamedani:
A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks. SIAM J. Optim. 29(4): 3036-3068 (2019) - 2017
- [c4]Erfan Yazdandoost Hamedani, Necdet Serhat Aybat:
Multi-agent constrained optimization of a strongly convex function over time-varying directed networks. Allerton 2017: 518-525 - [c3]Erfan Yazdandoost Hamedani, Necdet Serhat Aybat:
Multi-agent constrained optimization of a strongly convex function. GlobalSIP 2017: 558-562 - 2016
- [c2]Necdet Serhat Aybat, Erfan Yazdandoost Hamedani:
Distributed primal-dual method for multi-agent sharing problem with conic constraints. ACSSC 2016: 777-782 - [c1]Necdet Serhat Aybat, Erfan Yazdandoost Hamedani:
A primal-dual method for conic constrained distributed optimization problems. NIPS 2016: 5050-5058
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 2024-05-19 00:12 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:
