Positive definite completions of partial Hermitian matrices
From MaRDI portal
Publication:798738
DOI10.1016/0024-3795(84)90207-6zbMath0547.15011OpenAlexW2006704773WikidataQ115802379 ScholiaQ115802379MaRDI QIDQ798738
Eduardo Marques de Sá, Henry Wolkowicz, Charles R. Johnson, Robert D. Grone
Publication date: 1984
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(84)90207-6
Related Items
Matrix completions for linear matrix equations, Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems, Minimal separators of 2-chordal graphs, Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry, Logarithmic barriers for sparse matrix cones, Matrices with chordal inverse zero-patterns, Decomposition Methods for Sparse Matrix Nearness Problems, Experiments in stochastic computation for high-dimensional graphical models, Fast implementation for semidefinite programs with positive matrix completion, Invertible completions of band matrices, Operator System Structures and Extensions of Schur Multipliers, Wishart distributions for decomposable graphs, On Gaussian elimination and determinant formulas for matrices with chordal inverses, Rank-preserving extensions of band matrices, Exploiting sparsity for the min \(k\)-partition problem, Distributed consensus-based solver for semi-definite programming: an optimization viewpoint, Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures, On representing the positive semidefinite cone using the second-order cone, Do Sums of Squares Dream of Free Resolutions?, Exact Recovery with Symmetries for Procrustes Matching, Linear optimization over homogeneous matrix cones, Selfadhesivity in Gaussian conditional independence structures, On Sidorenko's conjecture for determinants and Gaussian Markov random fields, The Euclidean distance completion problem: cycle completability, Bounds for eigenvalues and singular values of matrix completions, A new global algorithm for max-cut problem with chordal sparsity, Determinantal formulae and nonsymmetric gaussian perfect elimination, Contractive symmetric matrix completion problems related to graphs, Invertible Selfadjoint Extensions of Band Matrices and Their Entropy, Correlation matrices of Gaussian Markov random fields over cycle graphs, Amalgamation of real zero polynomials, Wishart distributions for decomposable covariance graph models, Graphs with sparsity order at most two: the complex case, An efficient algorithm for maximum entropy extension of block-circulant covariance matrices, A matrix extension problem with entropy optimization, Operator systems for tolerance relations on finite sets, Positive semidefinite matrix completion, universal rigidity and the strong Arnold property, A Schur parametrization of non-negative Hermitian and contractive block matrices and the corresponding maximum entropy problems, Exploiting partial correlations in distributionally robust optimization, Symmetric completions of cycles and bipartite graphs, Geometric mean of partial positive definite matrices with missing entries, Exploiting term sparsity in noncommutative polynomial optimization, COSMO: a conic operator splitting method for convex conic problems, Decomposition of arrow type positive semidefinite matrices with application to topology optimization, Sums of Squares and Sparse Semidefinite Programming, A new graph parameter related to bounded rank positive semidefinite matrix completions, Completions of P-matrix patterns, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, Factorization of operator-valued polynomials in several non-commuting variables, A Bregman extension of quasi-Newton updates I: an information geometrical framework, Graph theoretic methods for matrix completion problems, A commutant lifting theorem for triangular matrices with diverse applications, Inertia possibilities for completions of partial hermitian matrices*, Deterministic inverse zero-patterns, Linearly constrained positive definite completions, The real positive definite completion problem for a 4-cycle, A semidefinite programming based polyhedral cut and price approach for the maxcut problem, Efficient local updates for undirected graphical models, Latest Developments in the SDPA Family for Solving Large-Scale SDPs, Euclidean Distance Matrices and Applications, On the Letac-Massam conjecture and existence of high dimensional Bayes estimators for graphical models, Research problem: The completion number of a graph, Preprocessing sparse semidefinite programs via matrix completion, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, A review of Gaussian Markov models for conditional independence, Limitations on the Expressive Power of Convex Cones without Long Chains of Faces, Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models, Unnamed Item, On the phases of a complex matrix, 2n-by-2n symplectic completions of matrices of order 2n − 1, An overview of semidefinite relaxations for optimal power flow problem, The completely positive and doubly nonnegative completion problems, EXTENSION OF BLOCK MATRIX REPRESENTATION OF THE GEOMETRIC MEAN, Dualistic differential geometry of positive definite matrices and its applications to related problems, Algebraic characterizations of chordality, Matrix estimation by universal singular value thresholding, Coordinate Shadows of Semidefinite and Euclidean Distance Matrices, Sharp lower and upper bounds for the Gaussian rank of a graph, SPN completable graphs, Shift invariant subspaces, factorization, and interpolation for matrices. I. The canonical case, Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Some exact distance constants, Invertible completions of partial operator matrices: The nonsymmetric case, Spanning-tree extensions of the Hadamard-Fischer inequalities, Completely positive completion of partial matrices whose entries are completely bounded maps, Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank, Completing a block diagonal matrix with a partially prescribed inverse, Connections between the real positive semidefinite and distance matrix completion problems, Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, Completion problem with partial correlation vines, Global completability with applications to self-consistent quantum tomography, Extremal rays and duals for cones of positive definite matrices with prescribed zeros, Rank decomposability in incident spaces, Combinatorial matrix analysis: An overview, Positive semidefinite matrices with a given sparsity pattern, Cuts, matrix completions and graph rigidity, Sparse sums of squares on finite abelian groups and improved semidefinite lifts, An optimal variant of Kelley's cutting-plane method, Copositive matrices with circulant zero support set, On the solvability of derived matrix problems, including completions and duals, Partial identification in the statistical matching problem, Large-scale semidefinite programming via a saddle point mirror-prox algorithm, Schur analysis of some completion problems, Schur products and matrix completions, Perfect elimination orderings for symmetric matrices, Completions of \(M\)-matrix patterns, A connection between positive semidefinite and Euclidean distance matrix completion problems, Structural conditions for cycle completable graphs, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, The completion problem for \(M\)-matrices and inverse \(M\)-matrices, Extensions of positive definite functions on free groups, Positive definite Hankel matrix completions and Hamburger moment completions, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, Critical exponents of graphs, On the uniqueness of Euclidean distance matrix completions., The elliptic matrix completion problem, Sparse matrix decompositions and graph characterizations, A parameterization of positive definite matrices in terms of partial correlation vines, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, Matrix completions and chordal graphs, Matrix completion problems for pairs of related classes of matrices., Bordered matrices, Geometry of maximum likelihood estimation in Gaussian graphical models, On linear programs with linear complementarity constraints, Maximum likelihood threshold and generic completion rank of graphs, Some extremal problems for positive definite matrices and operators, Posterior convergence rates for estimating large precision matrices using graphical models, Inheritance principles for chordal graphs, Sparse quasi-Newton updates with positive definite matrix completion, Lifting positive elements in \(C^*\)-algebras, The positive definite completion problem relative to a subspace, High, low, and quantitative roads in linear algebra, The symbiotic relationship of combinatorics and matrix theory, An inertia formula for Hermitian matrices with sparse inverses, Completion of operator partial matrices associated with chordal graphs, Completions of matrices and the commutant lifting theorem, The real positive semidefinite completion problem for series-parallel graphs, The positive definite completion problem revisited, The critical exponent: a novel graph invariant, One-step completions of Hermitian partial matrices with minimal negative signature, Positive semidefinite completions of partial Hermitian matrices, Power transmission network expansion planning: a semidefinite programming branch-and-bound approach, Max-min problems on the ranks and inertias of the matrix expressions \(A - BXC \pm (BXC)^{\ast}\) with applications, Semidefinite programming for discrete optimization and matrix completion problems, A parallel interior point decomposition algorithm for block angular semidefinite programs, Joint density of correlations in the correlation matrix with chordal sparsity patterns, A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices, The doubly negative matrix completion problem, Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion, Completion of partial matrices to contractions, The truncated Hamburger moment problems with gaps in the index set, Finding positive matrices subject to linear restrictions, Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming, Flexible covariance estimation in graphical Gaussian models, Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion, Faster, but weaker, relaxations for quadratically constrained quadratic programs, Completions of inverse \(M\)-matrix patterns, Extremal bipartite matrices, Determinantal formulae for matrix completions associated with chordal graphs, The inertia sets of symmetric tridiagonal sign-patterns, Bregman primal-dual first-order method and application to sparse semidefinite programming, Decomposed structured subsets for semidefinite and sum-of-squares optimization, Exploiting sparsity in complex polynomial optimization, \(P\)-matrix completions under weak symmetry assumptions, Exploiting special structure in semidefinite programming: a survey of theory and applications, The cycle completable graphs for the completely positive and doubly nonnegative completion problems, Inverse \(M\)-matrix completions of patterns omitting some diagonal positions, Some results on the Gaussian Markov random field construction problem based on the use of invariant subgraphs, Numerical ranges and matrix completions, Positive definite completions and determinant maximization, Sub-direct sums and positivity classes of matrices, The symmetric inverse \(M\)-matrix completion problem, AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization, Matrix sandwich problems, The real positive definite completion problem for a simple cycle, Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem, The completion of covariance kernels
Cites Work
