default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaryam Yashtini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Maryam Yashtini:
Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization. J. Glob. Optim. 84(4): 913-939 (2022)- [j11]Mengyi Tang
, Maryam Yashtini, Sung Ha Kang:
Counting Objects by Diffused Index: Geometry-free and training-free approach. J. Vis. Commun. Image Represent. 86: 103527 (2022) - 2021
- [j10]Maryam Yashtini:
Multi-block Nonconvex Nonsmooth Proximal ADMM: Convergence and Rates Under Kurdyka-Łojasiewicz Property. J. Optim. Theory Appl. 190(3): 966-998 (2021) - [i1]Mengyi Tang, Maryam Yashtini, Sung Ha Kang:
Counting Objects by Diffused Index: geometry-free and training-free approach. CoRR abs/2110.08365 (2021) - 2020
- [j9]Maryam Yashtini:
Euler's elastica-based algorithm for Parallel MRI reconstruction using SENSitivity Encoding. Optim. Lett. 14(6): 1435-1458 (2020)
2010 – 2019
- 2019
- [j8]Maryam Yashtini, Sung Ha Kang, Wei Zhu:
Efficient alternating minimization methods for variational edge-weighted colorization models. Adv. Comput. Math. 45(3): 1735-1767 (2019) - 2016
- [j7]Maryam Yashtini:
On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients. Optim. Lett. 10(6): 1361-1370 (2016) - [j6]Maryam Yashtini, Sung Ha Kang:
A Fast Relaxed Normal Two Split Method and an Effective Weighted TV Approach for Euler's Elastica Image Inpainting. SIAM J. Imaging Sci. 9(4): 1552-1581 (2016) - [j5]William W. Hager, Maryam Yashtini, Hongchao Zhang:
An O(1/k) Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm. SIAM J. Numer. Anal. 54(3): 1535-1556 (2016) - 2015
- [c3]Maryam Yashtini, Sung Ha Kang:
Alternating Direction Method of Multiplier for Euler's Elastica-Based Denoising. SSVM 2015: 690-701 - 2013
- [j4]Yunmei Chen, William W. Hager, Maryam Yashtini, Xiaojing Ye, Hongchao Zhang:
Bregman operator splitting with variable stepsize for total variation image reconstruction. Comput. Optim. Appl. 54(2): 317-342 (2013) - 2012
- [c2]Maryam Yashtini, William W. Hager, Yunmei Chen, Xiaojing Ye:
Partially parallel MR image reconstruction using sensitivity encoding. ICIP 2012: 2077-2080 - 2010
- [j3]Alaeddin Malek, Maryam Yashtini:
Image fusion algorithms for color and gray level images based on LCLS method and novel artificial neural network. Neurocomputing 73(4-6): 937-943 (2010)
2000 – 2009
- 2009
- [c1]Alaeddin Malek, Maryam Yashtini:
A Neural Network Model for Solving Nonlinear Optimization Problems with Real-Time Applications. ISNN (3) 2009: 98-108 - 2008
- [j2]Maryam Yashtini, Alaeddin Malek:
A discrete-time neural network for solving nonlinear convex problems with hybrid constraints. Appl. Math. Comput. 195(2): 576-584 (2008) - 2007
- [j1]Maryam Yashtini, Alaeddin Malek:
Solving complementarity and variational inequalities problems using neural networks. Appl. Math. Comput. 190(1): 216-230 (2007)
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-04-25 05:39 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:
