default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReza Mirzaeifard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Reza Mirzaeifard, Diyako Ghaderyan, Stefan Werner:
Decentralized Smoothing ADMM for Quantile Regression with Non-Convex Sparse Penalties. CoRR abs/2408.01307 (2024)- [i5]Reza Mirzaeifard, Diyako Ghaderyan, Stefan Werner:
Federated Smoothing Proximal Gradient for Quantile Regression with Non-Convex Penalties. CoRR abs/2408.05640 (2024) - 2023
- [c6]Reza Mirzaeifard, Naveen K. D. Venkategowda, Alexander Jung
, Stefan Werner:
Moreau Envelope ADMM for Decentralized Weakly Convex Optimization. APSIPA ASC 2023: 1126-1130 - [c5]Reza Mirzaeifard, Naveen K. D. Venkategowda, Stefan Werner:
Robust Networked Federated Learning for Localization. APSIPA ASC 2023: 1193-1198 - [c4]Reza Mirzaeifard, Vinay Chakravarthi Gogineni, Naveen K. D. Venkategowda, Stefan Werner:
Distributed Quantile Regression with Non-Convex Sparse Penalties. SSP 2023: 250-254 - [i4]Reza Mirzaeifard, Naveen K. D. Venkategowda, Stefan Werner:
Robust Networked Federated Learning for Localization. CoRR abs/2308.16737 (2023) - [i3]Reza Mirzaeifard, Naveen K. D. Venkategowda, Alexander Jung, Stefan Werner:
Moreau Envelope ADMM for Decentralized Weakly Convex Optimization. CoRR abs/2308.16752 (2023) - [i2]Reza Mirzaeifard, Naveen K. D. Venkategowda, Vinay Chakravarthi Gogineni, Stefan Werner:
Smoothing ADMM for Sparse-Penalized Quantile Regression with Non-Convex Penalties. CoRR abs/2309.03094 (2023) - 2022
- [c3]Reza Mirzaeifard, Naveen K. D. Venkategowda, Stefan Werner:
Robust Phase Retrieval with Non-Convex Penalties. IEEECONF 2022: 1291-1295 - [c2]Reza Mirzaeifard, Vinay Chakravarthi Gogineni, Naveen K. D. Venkategowda, Stefan Werner:
Dynamic Graph Topology Learning with Non-Convex Penalties. EUSIPCO 2022: 682-686 - [c1]Reza Mirzaeifard, Naveen K. D. Venkategowda, Vinay Chakravarthi Gogineni, Stefan Werner:
ADMM for Sparse-Penalized Quantile Regression with Non-Convex Penalties. EUSIPCO 2022: 2046-2050 - 2020
- [j1]Mostafa Tavassolipour, Armin Karamzade, Reza Mirzaeifard, Seyed Abolfazl Motahari, Mohammad Taghi Manzuri Shalmani:
Structure Learning of Sparse GGMs Over Multiple Access Networks. IEEE Trans. Commun. 68(2): 987-997 (2020)
2010 – 2019
- 2018
- [i1]Mostafa Tavassolipour, Armin Karamzade, Reza Mirzaeifard, Seyed Abolfazl Motahari, Mohammad Taghi Manzuri Shalmani:
Structure Learning of Sparse GGMs over Multiple Access Networks. CoRR abs/1812.10437 (2018)
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-09-19 00:31 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:
