scientific article; zbMATH DE number 4158856

MaRDI QIDQ3487569zbMATH OpenFDO

Authors Charles R. Johnson

Publication date 1990

zbMATH Keywords

determinantal inequalitiespartial matrixcompletions of partial matricescompletions of prescribed rankcontractions completionsmaximal determinant completionspositive completions

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Positive matrices and their generalizations; cones of matrices (15B48) Determinants, permanents, traces, other special matrix functions (15A15) Miscellaneous inequalities involving matrices (15A45) Vector spaces, linear dependence, rank, lineability (15A03) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)

Recommendations

• Survey on matrix completion models and algorithms
• Matrix completion problems
• On a Class of Matrix Completion Problems
• Some matrix completion problems
• Recent progress on matrix completion problems
• A note on matrix completion problems
• The nonsingular matrix completion problem
• The \(N_{0}^{1}\)-matrix completion problem
• Some empirical advances in matrix completion
• Matrix completion under complex survey sampling

Cited in

(76)

• scientific article; zbMATH DE number 4107004 (Why is no real title available?)
• 2n-by-2n symplectic completions of matrices of order 2n-1
• On inverse-positivity of sub-direct sums of matrices
• Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
• The completion problem for M-matrices and inverse M-matrices
• Completing triangular block matrices with maximal and minimal ranks
• A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
• The Birational Geometry of Ceva’s Theorem
• On the uniqueness of Euclidean distance matrix completions.
• Graph theoretic methods for matrix completion problems
• Contractive symmetric matrix completion problems related to graphs
• Matrix completion for the independence model
• On the equivalence between low-rank matrix completion and tensor rank
• Inverse \(M\)-matrices. II
• Direct approach to rank-1 completions of partial matrices
• Matrix sandwich problems
• Semidefinite programming for discrete optimization and matrix completion problems
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Distance geometry for kissing spheres
• Positive definite completions and determinant maximization
• A guide to conic optimisation and its applications
• Cuts, matrix completions and graph rigidity
• Matrix completion problems of block type
• \(P\)-matrix completions under weak symmetry assumptions
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
• A survey of totally positive matrix completion problems
• Completion of partial matrices to contractions
• Positive polynomials on projective limits of real algebraic varieties
• Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis
• Maximum entropy models for general lag patterns
• Minimizing the condition number of a positive definite matrix by completion
• Completion problems and sparsity for Kemeny's constant
• Topological aspects of matrix abduction. II
• Matrix completion from a computational statistics perspective
• Matrix completions, moments, and sums of Hermitian squares
• The symbiotic relationship of combinatorics and matrix theory
• An Answer to a Question of M. Newman on Matrix Completion
• An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
• On the uniqueness of Euclidean distance matrix completions: the case of points in general position
• Geometric mean of partial positive definite matrices with missing entries
• Binary matrix completion under diameter constraints
• The extremal ranks of \(A_1-B_1XC_1\) subject to a pair of matrix equations
• The real positive semidefinite completion problem for series-parallel graphs
• Uniqueness of the solutions of some completion problems
• Matrix completion problems
• Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
• Completions of triangular matrices: A survey of results and open problems
• Positive definite constrained least-squares estimation of matrices
• scientific article; zbMATH DE number 1336312 (Why is no real title available?)
• The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems
• Complex symmetric completions of partial operator matrices
• Triangular ranks do not bound minimum ranks in matrix completion
• The elliptic matrix completion problem
• scientific article; zbMATH DE number 1665566 (Why is no real title available?)
• On singular values of partially prescribed matrices
• Rectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sum
• Asymmetric TP and TN completion problems
• On the solvability of derived matrix problems, including completions and duals
• The positive definite completion problem revisited
• Interpolation in multivariable de Branges-Rovnyak spaces
• Completion of Hankel partial contractions of non-extremal type
• On completions of symmetric and antisymmetric block diagonal partial matrices
• The nonsingular matrix completion problem
• Extensions of positive definite functions on free groups
• Subdirect sums of \(P(P_0)\)-matrices and totally nonnegative matrices
• On Fiedler's characterization of tridiagonal matrices over arbitrary fields
• Maximum entropy for periodically correlated processes from nonconsecutive autocovariance coefficients
• High, low, and quantitative roads in linear algebra
• Min-rank conjecture for log-depth circuits
• Sub-direct sums and positivity classes of matrices
• Measures of generalized magnitude-squared coherence: differences and similarities
• The complexity of binary matrix completion under diameter constraints
• Completing symplectic matrices
• The real positive definite completion problem for a 4-cycle
• On the complexity of solving feasibility problems with regularized models

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487569)