Cones of diagonally dominant matrices

DOI10.2140/pjm.1975.57.15zbMath0283.52005OpenAlexW2035412546MaRDI QIDQ1844446

David H. Carlson, George Phillip Barker

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

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

Related Items

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