default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAfrooz Jalilzadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j7]Zeinab Alizadeh, Afrooz Jalilzadeh
, Farzad Yousefian:
Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games. Optim. Lett. 18(2): 377-401 (2024)- [j6]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) - [j5]Afrooz Jalilzadeh, Farzad Yousefian, Mohammadjavad Ebrahimi:
Stochastic Approximation for Estimating the Price of Stability in Stochastic Nash Games. ACM Trans. Model. Comput. Simul. 34(2): 7:1-7:24 (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) - [j3]I. E. Bardakci, Afrooz Jalilzadeh, Constantino M. Lagoa, Uday V. Shanbhag:
Probability maximization via Minkowski functionals: convex representations and tractable resolution. Math. Program. 199(1): 595-637 (2023) - 2022
- [j2]Afrooz Jalilzadeh, Angelia Nedic, Uday V. Shanbhag, Farzad Yousefian:
A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization. Math. Oper. Res. 47(1): 690-719 (2022) - 2021
- [j1]Afrooz Jalilzadeh:
Primal-dual incremental gradient method for nonsmooth and convex optimization problems. Optim. Lett. 15(8): 2541-2554 (2021)
Conference and Workshop Papers
- 2023
- [c11]Erfan Yazdandoost Hamedani, Afrooz Jalilzadeh, Necdet S. Aybat:
Randomized Primal-Dual Methods with Adaptive Step Sizes. AISTATS 2023: 11185-11212 - [c10]Morteza Boroun, Zeinab Alizadeh, Afrooz Jalilzadeh:
Accelerated Primal-dual Scheme for a Class of Stochastic Nonconvex-concave Saddle Point Problems. ACC 2023: 204-209 - [c9]Nazanin Abolfazli, Afrooz Jalilzadeh, Erfan Yazdandoost Hamedani:
An Accelerated Asynchronous Distributed Method for Convex Constrained Optimization Problems. CISS 2023: 1-6 - [c8]Morteza Boroun, Erfan Yazdandoost Hamedani, Afrooz Jalilzadeh:
Projection-Free Methods for Solving Nonconvex-Concave Saddle Point Problems. NeurIPS 2023 - [c7]Zeinab Alizadeh, Felipe Parra Polanco, Afrooz Jalilzadeh:
A Projection-Based Algorithm for Solving Stochastic Inverse Variational Inequality Problems. WSC 2023: 3532-3540 - 2022
- [c6]Zeinab Alizadeh, Brianna M. Otero, Afrooz Jalilzadeh:
An Inexact Variance-Reduced Method for Stochastic Quasi-Variational Inequality Problems with an Application In Healthcare. WSC 2022: 3099-3109 - 2021
- [c5]Morteza Boroun, Afrooz Jalilzadeh:
Inexact-Proximal Accelerated Gradient Method for Stochastic Nonconvex Constrained Optimization Problems. WSC 2021: 1-12 - 2019
- [c4]Afrooz Jalilzadeh, Uday V. Shanbhag:
Smoothed First-order Algorithms for Expectation-valued Constrained Problems. CISS 2019: 1 - [c3]Afrooz Jalilzadeh, Uday V. Shanbhag:
A Proximal-Point Algorithm with Variable Sample-Sizes (PPAWSS) for Monotone Stochastic Variational Inequality Problems. WSC 2019: 3551-3562 - 2018
- [c2]Afrooz Jalilzadeh, Angelia Nedic, Uday V. Shanbhag, Farzad Yousefian:
A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization. CDC 2018: 4097-4102 - 2016
- [c1]Afrooz Jalilzadeh, Uday V. Shanbhag:
eg-VSSA: An extragradient variable sample-size stochastic approximation scheme: Error analysis and complexity trade-offs. WSC 2016: 690-701
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-07-05 21:09 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:
