Results 241 to 250 of about 44,174 (262)

Fast Deterministic Algorithms for Matrix Completion Problems

SIAM Journal on Discrete Mathematics, 2013
Ivanyos, Karpinski, and Saxena [SIAM J. Comput., 39 (2010), pp. 3736--3751] have developed a deterministic polynomial time algorithm for finding scalars $x_1, \dots, x_n$ that maximize the rank of the matrix $B_0 + x_1B_1 + \dots + x_nB_n$ for given matrices $B_0, B_1, \dots, B_n$, where $B_1, \dots, B_n$ are of rank one.
openaire   +1 more source

The P-matrix problem is co-NP-complete

Mathematical Programming, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The problem of completing partial matrix functions as a classical interpolation problem

Journal of Mathematical Sciences, 1995
See the review in Zbl 0758.30033.
openaire   +1 more source

T-Product Factorization Based Method for Matrix and Tensor Completion Problems

Computational Optimization and Applications, 2023
Xinzhen Zhang, Quan Yu
exaly  

A matrix completion problem

2023
openaire   +1 more source

Matrix Completion Problems

2013
Luz DeAlba, Amy Wehe
openaire   +1 more source

Matrix Completion Problems

2006
Leslie Hogben, Amy Wangsness
openaire   +1 more source

Solving Euclidean Distance Matrix Completion Problems via Semidefinite Programming

Computational Optimization and Applications, 1999
Henry Wolkowicz
exaly  

The Inverse of Any Two-by-Two Nonsingular Partitioned Matrix and Three Matrix Inverse Completion Problems

Computers and Mathematics With Applications, 2009
Yoshio Takane, Yongge Tian
exaly  

Matrix Completion With Noise

Proceedings of the IEEE, 2010
Emmanuel Candès, Yaniv Plan
exaly