Results 1 to 10 of about 435,592 (297)
Explicit solutions to correlation matrix completion problems, with an application to risk management and insurance [PDF]
We derive explicit solutions to the problem of completing a partially specified correlation matrix. Our results apply to several block structures for the unspecified entries that arise in insurance and risk management, where an insurance company with ...
Dan I. Georgescu +2 more
doaj +3 more sources
In the paper the author gives results about the following two problems over an arbitrary field: Problem 1. Under which conditions does there exist a matrix with prescribed eigenvalues, characteristic polynomials, when some of its entries are prescribed and others vary. Problem 2.
M. Laurent
semanticscholar +4 more sources
DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS [PDF]
In this paper, we give general recommendations for successful application of the Douglas–Rachford reflection method to convex and nonconvex real matrix completion problems. These guidelines are demonstrated by various illustrative examples.
F. J. Aragón Artacho +2 more
semanticscholar +7 more sources
Graph theoretic methods for matrix completion problems
A pattern is a list of positions in an n×n real matrix. A matrix completion problem for the class of Π -matrices asks whether every partial Π -matrix whose specified entries are exactly the positions of the pattern can be completed to a Π -matrix.
L. Hogben
semanticscholar +3 more sources
The symmetric M-matrix and symmetric inverse M-matrix completion problems
The symmetric M -matrix and symmetric M 0 -matrix completion problems are solved and results of Johnson and Smith [Linear Algebra Appl. 290 (1999) 193] are extended to solve the symmetric inverse M -matrix completion problem: (1) A pattern (i.e., a list ...
L. Hogben
semanticscholar +4 more sources
The (weakly) sign symmetric P-matrix completion problems
The completion problem is studied for some sub-classes of the class of \(P\)-matrices. A {completion} of a partial matrix (i.e. a matrix with some unspecified entries) is a specific choice of values for the unspecified entries. A {pattern} for \(n\times n\) matrices is a subset of \(\mathcal{N}\times\mathcal{N}\) where \(\mathcal{N}=\{1,\dots,n\}\).
Luz M. DeAlba +3 more
semanticscholar +5 more sources
T-product factorization based method for matrix and tensor completion problems [PDF]
Low rank matrix and tensor completion problems are to recover the incomplete two and higher order data of low rank structures. The essential problem in the matrix and tensor completion problems is how to improve the efficiency.
Quan Yu, Xinzhen Zhang
semanticscholar +1 more source
A Nonconvex Method to Low-Rank Matrix Completion
In recent years, the problem of recovering a low-rank matrix from partial entries, known as low-rank matrix completion problem, has attracted much attention in many applications.
Haizhen He +3 more
doaj +1 more source
Fusion Algorithm for Matrix Completion Prediction Based on Probabilistic Meta-learning [PDF]
With the rapid development of Internet social media,using recommendation algorithms to effectively model and filter massive amounts of information has become the key to predict user behavior preferences,hot spot tendency,network security si-tuation and ...
QI Xiu-xiu, WANG Jia-hao, LI Wen-xiong, ZHOU Fan
doaj +1 more source
A regularised deep matrix factorised model of matrix completion for image restoration
It has been an important approach of using matrix completion to perform image restoration. Most previous works on matrix completion focus on the low‐rank property by imposing explicit constraints on the recovered matrix, such as the constraint of the ...
Zhemin Li +3 more
doaj +1 more source

