default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFarzad Yousefian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Zeinab Alizadeh, Afrooz Jalilzadeh
, Farzad Yousefian:
Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games. Optim. Lett. 18(2): 377-401 (2024)- [j11]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) - [c17]Mohammadjavad Ebrahimi, Uday V. Shanbhag, Farzad Yousefian:
Distributed Gradient Tracking Methods with Guarantees for Computing a Solution to Stochastic MPECs. ACC 2024: 2182-2187 - [c16]Sepideh Samadi, Daniel Alberto Burbano, Farzad Yousefian:
Achieving Optimal Complexity Guarantees for a Class of Bilevel Convex Optimization Problems. ACC 2024: 2206-2211 - 2023
- [j10]Daniel Alberto Burbano, Farzad Yousefian:
A Fish Rheotaxis Mechanism as a Zero-Order Optimization Strategy. IEEE Access 11: 102781-102795 (2023) - [j9]Shisheng Cui, Uday V. Shanbhag, Farzad Yousefian:
Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs. Math. Program. 198(2): 1153-1225 (2023) - [j8]Harshal D. Kaushik, Sepideh Samadi, Farzad Yousefian:
An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints. IEEE Trans. Autom. Control. 68(12): 7879-7886 (2023) - [c15]Yuyang Qiu, Uday V. Shanbhag, Farzad Yousefian:
Zeroth-Order Methods for Nondifferentiable, Nonconvex, and Hierarchical Federated Optimization. NeurIPS 2023 - 2022
- [j7]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
- [j6]Harshal D. Kaushik, Farzad Yousefian:
A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints. SIAM J. Optim. 31(3): 2171-2198 (2021) - [c14]Harshal D. Kaushik, Farzad Yousefian:
An Incremental Gradient Method for Large-scale Distributed Nonlinearly Constrained Optimization. ACC 2021: 953-958 - [c13]Farzad Yousefian:
Bilevel Distributed Optimization in Directed Networks. ACC 2021: 2230-2235 - 2020
- [j5]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis. SIAM J. Optim. 30(2): 1144-1172 (2020)
2010 – 2019
- 2019
- [j4]Nahidsadat Majlesinasab, Farzad Yousefian, Arash Pourhabib:
Self-Tuned Mirror Descent Schemes for Smooth and Nonsmooth High-Dimensional Stochastic Optimization. IEEE Trans. Autom. Control. 64(10): 4377-4384 (2019) - [c12]Nahidsadat Majlesinasab, Farzad Yousefian, Mohammad Javad Feizollahi:
A First-order Method for Monotone Stochastic Variational Inequalities on Semidefinite Matrix Spaces. ACC 2019: 169-174 - [c11]Harshal Kaushik, Farzad Yousefian:
A Randomized Block Coordinate Iterative Regularized Subgradient Method for High-dimensional Ill-posed Convex Optimization. ACC 2019: 3420-3425 - [c10]Mostafa Amini, Farzad Yousefian:
An Iterative Regularized Incremental Projected Subgradient Method for a Class of Bilevel Optimization Problems. ACC 2019: 4069-4074 - 2018
- [c9]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 - [c8]David Newton, Raghu Pasupathy, Farzad Yousefian:
Recent Trends in stochastic Gradient Descent for Machine Learning and Big Data. WSC 2018: 366-380 - 2017
- [j3]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems. Math. Program. 165(1): 391-431 (2017) - [c7]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
A smoothing stochastic quasi-newton method for non-lipschitzian stochastic optimization problems. WSC 2017: 2291-2302 - 2016
- [j2]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
Self-Tuned Stochastic Approximation Schemes for Non-Lipschitzian Stochastic Multi-User Optimization and Nash Games. IEEE Trans. Autom. Control. 61(7): 1753-1766 (2016) - [c6]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
Stochastic quasi-Newton methods for non-strongly convex problems: Convergence and rate analysis. CDC 2016: 4496-4503 - 2014
- [c5]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
Optimal robust smoothing extragradient algorithms for stochastic variational inequality problems. CDC 2014: 5831-5836 - 2013
- [c4]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
A distributed adaptive steplength stochastic approximation method for monotone stochastic Nash Games. ACC 2013: 4765-4770 - [c3]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
A regularized smoothing stochastic approximation (RSSA) algorithm for stochastic variational inequality problems. WSC 2013: 933-944 - 2012
- [j1]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On stochastic gradient and subgradient methods with adaptive steplength sequences. Autom. 48(1): 56-67 (2012) - 2011
- [c2]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
A regularized adaptive steplength stochastic approximation scheme for monotone stochastic variational inequalities. WSC 2011: 4115-4126 - [i1]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
On Stochastic Gradient and Subgradient Methods with Adaptive Steplength Sequences. CoRR abs/1105.4549 (2011) - 2010
- [c1]Farzad Yousefian, Angelia Nedic, Uday V. Shanbhag:
Convex nondifferentiable stochastic optimization: A local randomized smoothing technique. ACC 2010: 4875-4880
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-09 13: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:
