default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiao-Fen Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j16]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)- 2021
- [j15]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) - [j14]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) - [j13]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
- [j12]Jiao-Fen Li, Wen Li, Seak-Weng Vong, Qilun Luo, MingQing Xiao:
A Riemannian Optimization Approach for Solving the Generalized Eigenvalue Problem for Nonsquare Matrix Pencils. J. Sci. Comput. 82(3): 67 (2020) - 2017
- [j11]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
- [j10]Jiao-Fen Li, Wen Li, Ru Huang:
An efficient method for solving a matrix least squares problem over a matrix inequality constraint. Comput. Optim. Appl. 63(2): 393-423 (2016) - [j9]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) - 2014
- [j8]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) - 2011
- [j7]Xian-xia Liu, Jiao-Fen Li, Xi-Yan Hu:
Generalized inverse problems for part symmetric matrices on a subspace in structural dynamic model updating. Math. Comput. Model. 53(1-2): 110-121 (2011) - [j6]Jiao-Fen Li, Xi-Yan Hu, Lei Zhang:
Numerical solutions of AXB = C for centrosymmetric matrix X under a specified submatrix constraint. Numer. Linear Algebra Appl. 18(5): 857-873 (2011) - 2010
- [j5]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) - [j4]Jiao-Fen Li, Xi-Yan Hu, Lei Zhang:
New symmetry preserving method for optimal correction of damping and stiffness matrices using measured modes. J. Comput. Appl. Math. 234(5): 1572-1585 (2010) - [j3]Jiao-Fen Li, Xi-Yan Hu, Lei Zhang:
The nearness problems for symmetric centrosymmetric with a special submatrix constraint. Numer. Algorithms 55(1): 39-57 (2010) - [j2]Jiao-Fen Li, Xi-Yan Hu, Lei Zhang:
Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems. Theor. Comput. Sci. 411(31-33): 2818-2826 (2010) - 2009
- [j1]Jiao-Fen Li, Xi-Yan Hu, Lei Zhang:
The submatrix constraint problem of matrix equation AXB+CYD=E. Appl. Math. Comput. 215(7): 2578-2590 (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 22:24 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:
