default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGu-Yan Ni
Person information
- affiliation: National University of Defense Technology, Department of Mathematics, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Yang Xu, Guyan Ni
, Mengshi Zhang:
Bounds of the Solution Set to the Polynomial Complementarity Problem. J. Optim. Theory Appl. 203(1): 146-164 (2024)- [j14]Meng-Meng Zheng, Guyan Ni:
Block Diagonalization of Block Circulant Quaternion Matrices and the Fast Calculation for T-Product of Quaternion Tensors. J. Sci. Comput. 100(3): 69 (2024) - 2023
- [j13]Meng-Meng Zheng, Guyan Ni:
Approximation strategy based on the T-product for third-order quaternion tensors with application to color video compression. Appl. Math. Lett. 140: 108587 (2023) - [j12]Ciwen Chen, Guyan Ni, Bo Yang:
Partially symmetric tensor structure preserving rank-R approximation via BFGS algorithm. Comput. Optim. Appl. 85(2): 621-652 (2023) - [j11]Jiayin Jing, Guyan Ni, Ciwen Chen, Bo Yang:
Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-R approximation problem of symmetric tensors. J. Comput. Appl. Math. 420: 114792 (2023) - 2022
- [j10]Guyan Ni, Ying Li:
A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition. Math. Oper. Res. 47(4): 2931-2949 (2022) - 2021
- [j9]Lulu Cheng, Xinzhen Zhang, Guyan Ni:
A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems. J. Glob. Optim. 79(3): 715-732 (2021) - 2020
- [j8]Mengshi Zhang, Guyan Ni, Guofeng Zhang:
Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement. Comput. Optim. Appl. 75(3): 779-798 (2020)
2010 – 2019
- 2019
- [j7]Mengshi Zhang, Xinzhen Zhang, Guyan Ni:
Calculating Entanglement Eigenvalues for Nonsymmetric Quantum Pure States Based on the Jacobian Semidefinite Programming Relaxation Method. J. Optim. Theory Appl. 180(3): 787-802 (2019) - 2016
- [j6]Guyan Ni, Minru Bai:
Spherical optimization with complex variablesfor computing US-eigenpairs. Comput. Optim. Appl. 65(3): 799-820 (2016) - [j5]Minru Bai, Xiongjun Zhang, Guyan Ni, Chunfeng Cui:
An Adaptive Correction Approach for Tensor Completion. SIAM J. Imaging Sci. 9(3): 1298-1323 (2016) - 2014
- [j4]Guyan Ni, Liqun Qi, Minru Bai:
Geometric Measure of Entanglement and U-Eigenvalues of Tensors. SIAM J. Matrix Anal. Appl. 35(1): 73-87 (2014)
2000 – 2009
- 2007
- [j3]Min-Ru Bai, Shu-Zi Zhou, Gu-Yan Ni:
On the generalized monotonicity of variational inequalities. Comput. Math. Appl. 53(6): 910-917 (2007) - [j2]Guyan Ni, Yiju Wang:
On the best rank-1 approximation to higher-order symmetric tensors. Math. Comput. Model. 46(9-10): 1345-1352 (2007) - 2006
- [j1]Min-Ru Bai, Shu-Zi Zhou, Gu-Yan Ni:
Variational-like inequalities with relaxed eta-alpha pseudomonotone mappings in Banach spaces. Appl. Math. Lett. 19(6): 547-554 (2006)
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-12-02 22:31 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:
