default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaimin Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j27]Bingchen Cai, Haoran Li, Naimin Zhang, Mingyu Cao, Han Yu:
A cooperative jamming decision-making method based on multi-agent reinforcement learning. Auton. Intell. Syst. 5(1): 3 (2025)- [j26]Jinlan Zheng, Xingxing Ju, Naimin Zhang, Dongpo Xu
:
A neurodynamic approach with fixed-time convergence for complex-variable pseudo-monotone variational inequalities. Neurocomputing 617: 128988 (2025) - [j25]Wenhan Jiang, Jinlan Liu, Naimin Zhang, Dongpo Xu:
DMAdam: Dual averaging enhanced adaptive gradient method for deep neural networks. Knowl. Based Syst. 309: 112886 (2025) - 2024
- [j24]Jinlan Zheng, Xingxing Ju, Naimin Zhang, Dongpo Xu:
A novel predefined-time neurodynamic approach for mixed variational inequality problems and applications. Neural Networks 174: 106247 (2024) - [j23]Yuqing Liang, Dongpo Xu, Naimin Zhang, Danilo P. Mandic:
Almost sure convergence of stochastic composite objective mirror descent for non-convex non-smooth optimization. Optim. Lett. 18(9): 2113-2131 (2024) - [j22]Qiankun Diao, Jinlan Liu, Naimin Zhang, Dongpo Xu:
An Iterative Algorithm for Quaternion Eigenvalue Problems in Signal Processing. IEEE Signal Process. Lett. 31: 2505-2509 (2024)
2010 – 2019
- 2019
- [c3]Naimin Zhang:
On the Practical Optimal Momentum Parameters. ISKE 2019: 542-544 - 2016
- [j21]Yanhui Bi, Naimin Zhang, Lijuan Zhou:
On the optimal parameters of GMSSOR method for saddle point problems. Appl. Math. Lett. 55: 54-62 (2016) - 2015
- [j20]Naimin Zhang:
On parameter acceleration methods for saddle point problems. J. Comput. Appl. Math. 288: 169-179 (2015) - [j19]Naimin Zhang:
A Study on the Optimal Double Parameters for Steepest Descent with Momentum. Neural Comput. 27(4): 982-1004 (2015) - 2014
- [j18]Yuan Chen, Naimin Zhang:
A note on the generalization of parameterized inexact Uzawa method for singular saddle point problems. Appl. Math. Comput. 235: 318-322 (2014) - [j17]Lijuan Zhou, Naimin Zhang:
Semi-convergence analysis of GMSSOR methods for singular saddle point problems. Comput. Math. Appl. 68(5): 596-605 (2014) - [j16]Naimin Zhang, Tzon-Tzer Lu, Yimin Wei:
Semi-convergence analysis of Uzawa methods for singular saddle point problems. J. Comput. Appl. Math. 255: 334-345 (2014) - [j15]Zhen Chao, Naimin Zhang, Yunzeng Lu:
Optimal parameters of the generalized symmetric SOR method for augmented systems. J. Comput. Appl. Math. 266: 52-60 (2014) - [j14]Zhen Chao, Naimin Zhang:
A generalized preconditioned HSS method for singular saddle point problems. Numer. Algorithms 66(2): 203-221 (2014) - 2013
- [j13]Zhen Chao, Naimin Zhang, Pan Shen:
Convergence of P-regular splitting iterative methods for non-Hermitian positive semidefinite linear systems. Int. J. Comput. Math. 90(3): 630-640 (2013) - [j12]Naimin Zhang, Pan Shen:
Constraint preconditioners for solving singular saddle point problems. J. Comput. Appl. Math. 238: 116-125 (2013) - [j11]Naimin Zhang:
Semistability of Steepest Descent with Momentum for Quadratic Functions. Neural Comput. 25(5): 1277-1301 (2013) - 2011
- [j10]Haifeng Ma, Naimin Zhang:
A note on block-diagonally preconditioned PIU methods for singular saddle point problems. Int. J. Comput. Math. 88(16): 3448-3457 (2011) - 2010
- [j9]Naimin Zhang, Yimin Wei:
On the convergence of general stationary iterative methods for range-Hermitian singular linear systems. Numer. Linear Algebra Appl. 17(1): 139-154 (2010)
2000 – 2009
- 2009
- [j8]Naimin Zhang:
An online gradient method with momentum for two-layer feedforward neural networks. Appl. Math. Comput. 212(2): 488-498 (2009) - 2007
- [j7]Yimin Wei, Naimin Zhang, Michael K. Ng, Wei Xu:
Tikhonov regularization for weighted total least squares problems. Appl. Math. Lett. 20(1): 82-87 (2007) - 2006
- [j6]Naimin Zhang, Wei Wu, Gaofeng Zheng:
Convergence of gradient method with momentum for two-Layer feedforward neural networks. IEEE Trans. Neural Networks 17(2): 522-525 (2006) - [c2]Naimin Zhang:
Deterministic Convergence of an Online Gradient Method with Momentum. ICIC (1) 2006: 94-105 - 2005
- [j5]Naimin Zhang, Yimin Wei:
A note on solving EP inconsistent linear systems. Appl. Math. Comput. 169(1): 8-15 (2005) - 2004
- [j4]Yimin Wei, Naimin Zhang:
A note on the representation and approximation of the outer inverse AT, S(2) of a matrix A. Appl. Math. Comput. 147(3): 837-841 (2004) - [j3]Yimin Wei, Naimin Zhang:
Further note on constraint preconditioning for nonsymmetric indefinite matrices. Appl. Math. Comput. 152(1): 43-46 (2004) - [j2]Naimin Zhang, Yimin Wei:
Solving EP singular linear systems. Int. J. Comput. Math. 81(11): 1395-1405 (2004) - [c1]Wei Wu, Zhengxue Li, Guorui Feng, Naimin Zhang, Dong Nan, Zhiqiong Shao, Jie Yang, Liqing Zhang, Yuesheng Xu:
Recent Developments on Convergence of Online Gradient Methods for Neural Network Training. ISNN (1) 2004: 235-238 - 2003
- [j1]Naimin Zhang, Yimin Wei:
Perturbation bounds for the generalized inverses AT, S(2) with application to constrained linear system. Appl. Math. Comput. 142(1): 63-78 (2003)
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-03-04 21:13 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:
