Cones of diagonally dominant matrices

DOI10.2140/PJM.1975.57.15zbMATH Open0283.52005OpenAlexW2035412546MaRDI QIDQ1844446FDOQ1844446

Authors: George Phillip Barker, David H. Carlson 

Publication date: 1975

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1975.57.15

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Linear inequalities of matrices (15A39)

Cited In (59)

• Signatures of quantum phase transitions from the boundary of the numerical range
• Closing duality gaps of SDPs completely through perturbation when singularity degree is one
• The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
• Diagonally Dominant Principal Component Analysis
• Homogeneous and facially homogeneous self-dual cones
• A remark on the faces of the cone of Euclidean distance matrices
• The extreme points of a set of positive semidefinite operators
• Some applications of optimization in matrix theory
• Unifying optimal partition approach to sensitivity analysis in conic optimization
• FACIAL STRUCTURES FOR VARIOUS NOTIONS OF POSITIVITY AND APPLICATIONS TO THE THEORY OF ENTANGLEMENT
• Semidefinite programming
• A semidefinite programming study of the Elfving theorem
• Semidefinite programming relaxations for the graph partitioning problem
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
• Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
• Polyhedral approximations of the semidefinite cone and their application
• Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
• Complementarity problems with respect to Loewnerian cones
• Maximum feasible subsystems of distance geometry constraints
• Operator systems and convex sets with many normal cones
• The structural physical approximation conjecture
• Distance geometry and data science
• The cone of distance matrices
• On the completely positive and positive semidefinite-preserving cones. III.
• Extrémales du cône des matrices de type non négatif, à coefficients positifs ou nuls
• Computing the nearest diagonally dominant matrix
• Circum-Euclidean distance matrices and faces
• Extreme Points in Convex Sets of Symmetric Matrices
• Characterizing bad semidefinite programs: normal forms and short proofs
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• On the completely positive and positive-semidefinite-preserving cones
• Faces and duality in convex cones
• LP-based tractable subcones of the semidefinite plus nonnegative cone
• Regularizing the abstract convex program
• A note on diagonally dominant matrices
• The \(\mathrm{PPT}^2\) conjecture holds for all Choi-type maps
• Cone-LP's and semidefinite programs: geometry and a simplex-type method
• Theory of cones
• On factor width and symmetric \(H\)-matrices
• Local minima and convergence in low-rank semidefinite programming
• Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
• Optimization over structured subsets of positive semidefinite matrices via column generation
• Optimal ℓ 1 Rank One Matrix Decomposition
• On the cone of completely positive linear transformations
• Explicit solutions for interval semidefinite linear programs
• Sum of squares basis pursuit with linear and second order cone programming
• Applications of the Joint Angular Field of Values
• On the cone of positive semidefinite matrices
• An optimization problem on subsets of the symmetric positive-semidefinite matrices
• On a positive semidefinite relaxation of the cut polytope
• Some geometric results in semidefinite programming
• Decomposed structured subsets for semidefinite and sum-of-squares optimization
• On Farkas lemma and dimensional rigidity of bar frameworks
• Solving SDP completely with an interior point oracle
• A Scalable Algorithm for Sparse Portfolio Selection
• Primal and polar approach for computing the symmetric diagonally dominant projection
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• Eigenvalue-constrained faces
• Universal rigidity of bar frameworks via the geometry of spectrahedra

This page was built for publication: Cones of diagonally dominant matrices

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