scientific article; zbMATH DE number 4158856

zbMATH Open0706.15024MaRDI QIDQ3487569FDOQ3487569

Authors: Charles R. Johnson 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

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)

Cited In (67)

• A guide to conic optimisation and its applications
• Maximum entropy models for general lag patterns
• Matrix completion from a computational statistics perspective
• Geometric mean of partial positive definite matrices with missing entries
• Triangular ranks do not bound minimum ranks in matrix completion
• Title not available (Why is that?)
• Interpolation in multivariable de Branges-Rovnyak spaces
• On inverse-positivity of sub-direct sums of matrices
• The completion problem for \(M\)-matrices and inverse \(M\)-matrices
• Topological Aspects of Matrix Abduction 2
• Completing triangular block matrices with maximal and minimal ranks
• A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
• Graph theoretic methods for matrix completion problems
• On the uniqueness of Euclidean distance matrix completions.
• On the equivalence between low-rank matrix completion and tensor rank
• Inverse \(M\)-matrices. II
• Matrix sandwich problems
• Semidefinite programming for discrete optimization and matrix completion problems
• Distance geometry for kissing spheres
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Matrix completion problems of block type
• Positive definite completions and determinant maximization
• Cuts, matrix completions and graph rigidity
• \(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
• Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis
• Positive polynomials on projective limits of real algebraic varieties
• Completion of partial matrices to contractions
• Minimizing the condition number of a positive definite matrix by completion
• Matrix completions, moments, and sums of Hermitian squares
• An Answer to a Question of M. Newman on Matrix Completion
• The symbiotic relationship of combinatorics and matrix theory
• 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
• The extremal ranks of \(A_1-B_1XC_1\) subject to a pair of matrix equations
• Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
• Uniqueness of the solutions of some completion problems
• The real positive semidefinite completion problem for series-parallel graphs
• Matrix completion problems
• Completions of triangular matrices: A survey of results and open problems
• Title not available (Why is that?)
• Positive definite constrained least-squares estimation of matrices
• 2n-by-2n symplectic completions of matrices of order 2n − 1
• Complex symmetric completions of partial operator matrices
• The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems
• The elliptic matrix completion problem
• 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
• The positive definite completion problem revisited
• On the solvability of derived matrix problems, including completions and duals
• Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
• The nonsingular matrix completion problem
• Extensions of positive definite functions on free groups
• Maximum entropy for periodically correlated processes from nonconsecutive autocovariance coefficients
• Subdirect sums of \(P(P_0)\)-matrices and totally nonnegative matrices
• On Fiedler's characterization of tridiagonal matrices over arbitrary fields
• Min-rank conjecture for log-depth circuits
• High, low, and quantitative roads in linear algebra
• The complexity of binary matrix completion under diameter constraints
• Sub-direct sums and positivity classes of matrices
• Measures of generalized magnitude-squared coherence: differences and similarities
• The real positive definite completion problem for a 4-cycle
• Completing symplectic matrices
• On the complexity of solving feasibility problems with regularized models
• Title not available (Why is that?)

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)