Positive definite completions of partial Hermitian matrices
From MaRDI portal
Publication:798738
DOI10.1016/0024-3795(84)90207-6zbMATH Open0547.15011OpenAlexW2006704773WikidataQ115802379 ScholiaQ115802379MaRDI QIDQ798738FDOQ798738
Authors: Charles R. Johnson, E. Marques de Sá, Henry Wolkowicz, 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
Recommendations
Cites Work
Cited In (only showing first 100 items - show all)
- The completion problem for \(M\)-matrices and inverse \(M\)-matrices
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Schur products and matrix completions
- The positive definite completion problem relative to a subspace
- Positive matrices partitioned into a small number of Hermitian blocks
- Flexible covariance estimation in graphical Gaussian models
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- A connection between positive semidefinite and Euclidean distance matrix completion problems
- Combinatorial matrix analysis: An overview
- Structural conditions for cycle completable graphs
- Experiments in stochastic computation for high-dimensional graphical models
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
- Spanning-tree extensions of the Hadamard-Fischer inequalities
- SPN completable graphs
- Sparse matrix decompositions and graph characterizations
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Max-min problems on the ranks and inertias of the matrix expressions \(A - BXC \pm (BXC)^{\ast}\) with applications
- One-step completions of Hermitian partial matrices with minimal negative signature
- Matrix estimation by universal singular value thresholding
- Completions of \(M\)-matrix patterns
- Matrix sandwich problems
- Positive semidefinite completions of partial Hermitian matrices
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Semidefinite programming for discrete optimization and matrix completion problems
- 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
- Completion of partial matrices to contractions
- Matrices with chordal inverse zero-patterns
- Wishart distributions for decomposable covariance graph models
- The symmetric inverse \(M\)-matrix completion problem
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- Wishart distributions for decomposable graphs
- Posterior convergence rates for estimating large precision matrices using graphical models
- An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
- Bounds for eigenvalues and singular values of matrix completions
- Connections between the real positive semidefinite and distance matrix completion problems
- A Schur parametrization of non-negative Hermitian and contractive block matrices and the corresponding maximum entropy problems
- Global completability with applications to self-consistent quantum tomography
- Fast implementation for semidefinite programs with positive matrix completion
- A commutant lifting theorem for triangular matrices with diverse applications
- The real positive semidefinite completion problem for series-parallel graphs
- On linear programs with linear complementarity constraints
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts
- Factorization of operator-valued polynomials in several non-commuting variables
- Positive semidefinite matrices with a given sparsity pattern
- The elliptic matrix completion problem
- A parameterization of positive definite matrices in terms of partial correlation vines
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- An optimal variant of Kelley's cutting-plane method
- The real positive definite completion problem for a simple cycle
- The positive definite completion problem revisited
- Copositive matrices with circulant zero support set
- On the solvability of derived matrix problems, including completions and duals
- Dualistic differential geometry of positive definite matrices and its applications to related problems
- An inertia formula for Hermitian matrices with sparse inverses
- Extremal bipartite matrices
- Extensions of positive definite functions on free groups
- Euclidean distance matrices and applications
- Inverse \(M\)-matrix completions of patterns omitting some diagonal positions
- Determinantal formulae for matrix completions associated with chordal graphs
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- Sparse quasi-Newton updates with positive definite matrix completion
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Completion problem with partial correlation vines
- Completions of inverse \(M\)-matrix patterns
- Sub-direct sums and positivity classes of matrices
- The inertia sets of symmetric tridiagonal sign-patterns
- Inertia possibilities for completions of partial hermitian matrices*
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- The completely positive and doubly nonnegative completion problems
- Logarithmic barriers for sparse matrix cones
- Geometry of maximum likelihood estimation in Gaussian graphical models
- Hyper Inverse Wishart Distribution for Non-decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models
- Efficient local updates for undirected graphical models
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- Coordinate shadows of semidefinite and Euclidean distance matrices
- The real positive definite completion problem for a 4-cycle
- Some results on the Gaussian Markov random field construction problem based on the use of invariant subgraphs
- The cycle completable graphs for the completely positive and doubly nonnegative completion problems
- Completions of P-matrix patterns
- Sums of squares and sparse semidefinite programming
- Shift invariant subspaces, factorization, and interpolation for matrices. I. The canonical case
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization
- Maximum likelihood threshold and generic completion rank of graphs
- \(2n\)-by-\(2n\) symplectic completions of matrices of order \(2n-1\)
- The Euclidean distance completion problem: cycle completability
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- The truncated moment problem on reducible cubic curves. I: Parabolic and circular type relations
- An overview of semidefinite relaxations for optimal power flow problem
- Do sums of squares dream of free resolutions?
- Graphs with sparsity order at most two: the complex case
- Decomposition methods for sparse matrix nearness problems
- A Bregman extension of quasi-Newton updates I: An information geometrical framework
- Matrix completions and chordal graphs
- Operator system structures and extensions of Schur multipliers
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
This page was built for publication: Positive definite completions of partial Hermitian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798738)
