Остановите войну!
for scientists:
default search action
Maolin Che
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j30]Xuezhong Wang, Maolin Che, Changxin Mo, Yiming Wei:
Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method. J. Comput. Appl. Math. 421: 114856 (2023) - [j29]Maolin Che, Yiming Wei, Yanwei Xu:
Randomized algorithms for the computation of multilinear rank-(μ 1,μ 2,μ 3) approximations. J. Glob. Optim. 87(2): 373-403 (2023) - [i2]Maolin Che, Yimin Wei, Hong Yan:
Efficient algorithms for Tucker decomposition via approximate matrix multiplication. CoRR abs/2303.11612 (2023) - 2022
- [j28]Xuezhong Wang, Maolin Che, Yiming Wei:
Randomized Kaczmarz methods for tensor complementarity problems. Comput. Optim. Appl. 82(3): 595-615 (2022) - [j27]Maolin Che, Juefei Chen, Yiming Wei:
Perturbations of the Tcur Decomposition for Tensor Valued Data in the Tucker Format. J. Optim. Theory Appl. 194(3): 852-877 (2022) - [j26]Maolin Che, Yiming Wei:
An Efficient Algorithm for Computing the Approximate t-URV and its Applications. J. Sci. Comput. 92(3): 93 (2022) - [j25]Maolin Che, Xuezhong Wang, Yiming Wei, Xile Zhao:
Fast randomized tensor singular value thresholding for low-rank tensor optimization. Numer. Linear Algebra Appl. 29(6) (2022) - 2021
- [j24]Maolin Che, Yiming Wei, Hong Yan:
Randomized algorithms for the low multilinear rank approximations of tensors. J. Comput. Appl. Math. 390: 113380 (2021) - [j23]Maolin Che, Yiming Wei, Hong Yan:
An Efficient Randomized Algorithm for Computing the Approximate Tucker Decomposition. J. Sci. Comput. 88(1): 32 (2021) - [j22]Xuezhong Wang, Changxin Mo, Maolin Che, Yiming Wei:
Accelerated dynamical approaches for finding the unique positive solution of KS-tensor equations. Numer. Algorithms 88(4): 1787-1810 (2021) - 2020
- [j21]Shouqiang Du, Maolin Che, Yiming Wei:
Stochastic structured tensors to stochastic complementarity problems. Comput. Optim. Appl. 75(3): 649-668 (2020) - [j20]Xuezhong Wang, Maolin Che, Yiming Wei:
Tensor neural network models for tensor singular value decompositions. Comput. Optim. Appl. 75(3): 753-777 (2020) - [j19]Xuezhong Wang, Maolin Che, Yiming Wei:
Neural network approach for solving nonsingular multi-linear tensor systems. J. Comput. Appl. Math. 368 (2020) - [j18]Maolin Che, Yiming Wei:
Multiplicative Algorithms for Symmetric Nonnegative Tensor Factorizations and Its Applications. J. Sci. Comput. 83(3): 53 (2020) - [j17]Xuezhong Wang, Maolin Che, Yiming Wei:
Global uniqueness and solvability of tensor complementarity problems for ℋ+-tensors. Numer. Algorithms 84(2): 567-590 (2020) - [j16]Xuezhong Wang, Maolin Che, Yiming Wei:
Preconditioned tensor splitting AOR iterative methods for ℋℋ ℋ -tensor equations. Numer. Linear Algebra Appl. 27(6) (2020) - [j15]Maolin Che, Xuezhong Wang, Yiming Wei:
A Unified Self-Stabilizing Neural Network Algorithm for Principal Takagi Component Extraction. Neural Process. Lett. 51(1): 591-610 (2020) - [j14]Xuezhong Wang, Maolin Che, Liqun Qi, Yiming Wei:
Modified gradient dynamic approach to the tensor complementarity problem. Optim. Methods Softw. 35(2): 394-415 (2020) - [j13]Maolin Che, Yiming Wei, Hong Yan:
The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection. SIAM J. Matrix Anal. Appl. 41(2): 605-636 (2020)
2010 – 2019
- 2019
- [j12]Maolin Che, Yiming Wei:
Randomized algorithms for the approximations of Tucker and the tensor train decompositions. Adv. Comput. Math. 45(1): 395-428 (2019) - [j11]Xuezhong Wang, Maolin Che, Yiming Wei:
Existence and uniqueness of positive solution for H+-tensor equations. Appl. Math. Lett. 98: 191-198 (2019) - [j10]Xuezhong Wang, Maolin Che, Yiming Wei:
Neural networks based approach solving multi-linear systems with M-tensors. Neurocomputing 351: 33-42 (2019) - [j9]Maolin Che, Liqun Qi, Yiming Wei:
Stochastic $$R_0$$ R 0 tensors to stochastic tensor complementarity problems. Optim. Lett. 13(2): 261-279 (2019) - [i1]Maolin Che, Yimin Wei, Hong Yan:
Randomized algorithms for the low multilinear rank approximations of tensors. CoRR abs/1908.11031 (2019) - 2018
- [j8]Maolin Che, Liqun Qi, Yiming Wei, Guofeng Zhang:
Geometric measures of entanglement in multipartite pure states via complex-valued neural networks. Neurocomputing 313: 25-38 (2018) - [j7]Maolin Che, Sanzheng Qiao, Yiming Wei:
Adaptive algorithms for computing the principal Takagi vector of a complex symmetric matrix. Neurocomputing 317: 79-87 (2018) - [j6]Xuezhong Wang, Maolin Che, Yiming Wei:
Partial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorization. J. Comput. Appl. Math. 332: 56-71 (2018) - 2017
- [j5]Xuezhong Wang, Maolin Che, Yiming Wei:
Complex-valued neural networks for the Takagi vector of complex symmetric matrices. Neurocomputing 223: 77-85 (2017) - [j4]Maolin Che, Andrzej Cichocki, Yiming Wei:
Neural networks for computing best rank-one approximations of tensors and its applications. Neurocomputing 267: 114-133 (2017) - [j3]Maolin Che, Liqun Qi, Yiming Wei:
Iterative algorithms for computing US- and U-eigenpairs of complex tensors. J. Comput. Appl. Math. 317: 547-564 (2017) - 2016
- [j2]Xuezhong Wang, Maolin Che, Yiming Wei:
Recurrent neural network for computation of generalized eigenvalue problem with real diagonalizable matrix pair and its applications. Neurocomputing 216: 230-241 (2016) - [j1]Maolin Che, Liqun Qi, Yiming Wei:
Positive-Definite Tensors to Nonlinear Complementarity Problems. J. Optim. Theory Appl. 168(2): 475-487 (2016)
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-03-08 02:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint