scientific article

From MaRDI portal
Revision as of 22:05, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3487569

zbMath0706.15024MaRDI QIDQ3487569

Charles R. Johnson

Publication date: 1990


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (51)

On the complexity of solving feasibility problems with regularized modelsUniqueness of the solutions of some completion problemsOn inverse-positivity of sub-direct sums of matricesPositive definite constrained least-squares estimation of matricesCuts, matrix completions and graph rigidityOn the solvability of derived matrix problems, including completions and dualsMeasures of generalized magnitude-squared coherence: differences and similaritiesMaximum entropy models for general lag patternsThe extremal ranks of \(A_1-B_1XC_1\) subject to a pair of matrix equationsThe completion problem for \(M\)-matrices and inverse \(M\)-matricesExtensions of positive definite functions on free groupsTopological Aspects of Matrix Abduction 2The complexity of binary matrix completion under diameter constraintsAsymmetric TP and TN completion problemsInterpolation in multivariable de Branges-Rovnyak spacesOn the uniqueness of Euclidean distance matrix completions.The elliptic matrix completion problemAn efficient algorithm for maximum entropy extension of block-circulant covariance matricesRecent results on Douglas-Rachford methods for combinatorial optimization problemsMin-rank conjecture for log-depth circuitsGeometric mean of partial positive definite matrices with missing entriesA guide to conic optimisation and its applicationsHigh, low, and quantitative roads in linear algebraThe symbiotic relationship of combinatorics and matrix theoryOn the equivalence between low-rank matrix completion and tensor rankThe real positive semidefinite completion problem for series-parallel graphsThe positive definite completion problem revisitedSubdirect sums of \(P(P_0)\)-matrices and totally nonnegative matricesFinding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex OptimizationSemidefinite programming for discrete optimization and matrix completion problemsGraph theoretic methods for matrix completion problemsThe inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problemsInverse \(M\)-matrices. IIA direct proof for the matrix decomposition of chordal-structured positive semidefinite matricesOn the uniqueness of Euclidean distance matrix completions: the case of points in general positionOn Fiedler's characterization of tridiagonal matrices over arbitrary fieldsThe real positive definite completion problem for a 4-cyclePositive polynomials on projective limits of real algebraic varietiesPositive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programmingMaximum entropy for periodically correlated processes from nonconsecutive autocovariance coefficients2n-by-2n symplectic completions of matrices of order 2n − 1\(P\)-matrix completions under weak symmetry assumptionsCompleting symplectic matricesComplex symmetric completions of partial operator matricesRectangular submatrices of inverse \(\mathcal M\)-matrices and the decomposition of a positive matrix as a sumPositive definite completions and determinant maximizationSub-direct sums and positivity classes of matricesMatrix sandwich problemsCompleting triangular block matrices with maximal and minimal ranksDistance geometry for kissing spheresStrengthened semidefinite relaxations via a second lifting for the Max-Cut problem







This page was built for publication: