default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXue-Feng Duan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Guoqiang Deng, Yongzhuang Wei
, Xuefeng Duan, Enes Pasalic, Samir Hodzic:
Specifying cycles of minimal length for commonly used linear layers in block ciphers. J. Inf. Secur. Appl. 84: 103824 (2024)- [j27]Zhaolu Tian, Yudong Wang, Yinghui Dong, Xuefeng Duan:
The shifted inner-outer iteration methods for solving Sylvester matrix equations. J. Frankl. Inst. 361(5): 106674 (2024) - [j26]Zhaolu Tian, Xuefeng Duan, Nian-Ci Wu, Zhongyun Liu:
The parameterized accelerated iteration method for solving the matrix equation AXB=C. Numer. Algorithms 97(2): 843-867 (2024) - 2023
- [j25]Shan-Qi Duan, Xue-Feng Duan, Chunmei Li, Jiao-Fen Li:
Riemannian conjugate gradient method for low-rank tensor completion. Adv. Comput. Math. 49(3): 41 (2023) - [j24]Guoqiang Deng, Xuefeng Duan, Min Tang, Yuhao Zhang, Ying Huang:
Non-interactive and privacy-preserving neural network learning using functional encryption. Future Gener. Comput. Syst. 145: 454-465 (2023) - [i2]Shan-Qi Duan, Qing-Wen Wang, Xue-Feng Duan:
On Rayleigh Quotient Iteration for Dual Quaternion Hermitian Eigenvalue Problem. CoRR abs/2310.20290 (2023) - 2022
- [j23]Shan-Qi Duan, Xue-Feng Duan, Xi-Le Zhao:
A New Tensor Multi-rank Approximation with Total Variation Regularization for Tensor Completion. J. Sci. Comput. 93(2): 61 (2022) - [j22]Guoqiang Deng, Niuniu Qi, Min Tang, Xuefeng Duan:
Constructing Dixon Matrix for Sparse Polynomial Equations Based on Hybrid and Heuristics Scheme. Symmetry 14(6): 1174 (2022) - 2021
- [j21]Jiao-Fen Li, Wen Li, Xue-Feng Duan, Mingqing Xiao:
Newton's method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils. Adv. Comput. Math. 47(2): 29 (2021) - [j20]Rui Wang, Guoqiang Deng, Xue-Feng Duan:
An image encryption scheme based on double chaotic cyclic shift and Josephus problem. J. Inf. Secur. Appl. 58: 102699 (2021) - [j19]Xue-Feng Duan, Juan Li, Shan-Qi Duan, Qing-Wen Wang:
Numerical method for the generalized nonnegative tensor factorization problem. Numer. Algorithms 87(2): 499-510 (2021) - [j18]Jiao-Fen Li, Kai Wang, Yue-yuan Liu, Xue-Feng Duan, Xue-lin Zhou:
A trust-region method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils. Numer. Linear Algebra Appl. 28(4) (2021) - [j17]Xue-Feng Duan, Shan-Qi Duan, Juan Li, Jiao-Fen Li, Qing-Wen Wang:
An efficient algorithm for solving the nonnegative tensor least squares problem. Numer. Linear Algebra Appl. 28(6) (2021) - 2020
- [j16]Tao Li, Qing-Wen Wang, Xue-Feng Duan:
Numerical algorithms for solving discrete Lyapunov tensor equation. J. Comput. Appl. Math. 370 (2020) - [j15]Xuefeng Duan, Chi-Kwong Li, Diane Christine Pelejo:
Construction of quantum states with special properties by projection methods. Quantum Inf. Process. 19(11): 1-34 (2020) - [i1]Guoqiang Deng, Yongzhuang Wei, Xuefeng Duan, Enes Pasalic, Samir Hodzic:
Specifying cycles of minimal length for commonly used linear layers in block ciphers. IACR Cryptol. ePrint Arch. 2020: 1163 (2020)
2010 – 2019
- 2019
- [j14]Xue-Feng Duan, Cun-Yun Wang, Chunmei Li:
Newton's method for solving the tensor square root problem. Appl. Math. Lett. 98: 57-62 (2019) - [j13]Chunmei Li, Xuefeng Duan, Linzhang Lu, Qingwen Wang, Shuqian Shen:
Iterative algorithm for solving a class of convex feasibility problem. J. Comput. Appl. Math. 352: 352-367 (2019) - 2017
- [j12]Xue-Feng Duan, Chunmei Li, Jiao-Fen Li, Yong Ding:
Numerical methods for solving some matrix feasibility problems. Numer. Algorithms 74(2): 461-479 (2017) - 2016
- [j11]Xue-Feng Duan, Jianchao Bai, Jiao-Fen Li, Jing-Jing Peng:
On the low rank solution of the Q-weighted nearest correlation matrix problem. Numer. Linear Algebra Appl. 23(2): 340-355 (2016) - 2015
- [j10]Jianchao Bai, Xuefeng Duan, Kexin Cheng, Xuewei Zhang:
A Class of Weighted Low Rank Approximation of the Positive Semidefinite Hankel Matrix. J. Appl. Math. 2015: 937573:1-937573:7 (2015) - 2014
- [j9]Xuefeng Duan, Jiao-Fen Li, Qingwen Wang, Xinjun Zhang:
Low rank approximation of the symmetric positive semidefinite matrix. J. Comput. Appl. Math. 260: 236-243 (2014) - 2013
- [j8]Xuefeng Duan, Chunmei Li, An-ping Liao, Ronghao Wang:
On two classes of mixed-type Lyapunov equations. Appl. Math. Comput. 219(16): 8486-8495 (2013) - [j7]Shi-Fang Yuan, Qing-Wen Wang, Xue-Feng Duan:
On solutions of the quaternion matrix equation AX=BAX=B and their applications in color image restoration. Appl. Math. Comput. 221: 10-20 (2013) - 2012
- [j6]Xue-Feng Duan, Qing-Wen Wang:
Perturbation Analysis for the Matrix Equation X - Σi=1m Ai* X Ai + Σj=1n Bj* X Bj = I. J. Appl. Math. 2012: 784620:1-784620:13 (2012) - 2011
- [j5]Xuefeng Duan, Chunmei Li, An-ping Liao:
Solutions and perturbation analysis for the nonlinear matrix equation X + Σmi=1Ai*X-1Ai = I. Appl. Math. Comput. 218(8): 4458-4466 (2011) - [j4]Guozhu Yao, An-ping Liao, Xuefeng Duan:
Positive definite solution of the matrix equation X=Q+AH(IÄX-C)dA. Numer. Algorithms 56(3): 349-361 (2011) - 2010
- [j3]An-ping Liao, Guozhu Yao, Xue-Feng Duan:
Thompson metric method for solving a class of nonlinear matrix equation. Appl. Math. Comput. 216(6): 1831-1836 (2010) - [j2]Jiao-Fen Li, Xi-Yan Hu, Xue-Feng Duan, Lei Zhang:
Numerical solutions of AXB = C for mirrorsymmetric matrix X under a specified submatrix constraint. Computing 90(1-2): 39-56 (2010)
2000 – 2009
- 2009
- [j1]Xue-Feng Duan, An-ping Liao:
On the nonlinear matrix equation X+A*X-qA=Q(q≥1). Math. Comput. Model. 49(5-6): 936-945 (2009)
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-10-07 21:26 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:
