Cited in
(59)- 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
- A semidefinite programming study of the Elfving theorem
- Semidefinite programming
- FACIAL STRUCTURES FOR VARIOUS NOTIONS OF POSITIVITY AND APPLICATIONS TO THE THEORY OF ENTANGLEMENT
- Semidefinite programming relaxations for the graph partitioning problem
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Polyhedral approximations of the semidefinite cone and their application
- Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
- 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
- Signatures of quantum phase transitions from the boundary of the numerical range
- The structural physical approximation conjecture
- Operator systems and convex sets with many normal cones
- Distance geometry and data science
- On the completely positive and positive semidefinite-preserving cones. III.
- The cone of distance matrices
- 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
- On the completely positive and positive-semidefinite-preserving cones
- 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
- LP-based tractable subcones of the semidefinite plus nonnegative cone
- Faces and duality in convex cones
- Regularizing the abstract convex program
- A note on diagonally dominant matrices
- The \(\mathrm{PPT}^2\) conjecture holds for all Choi-type maps
- Theory of cones
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- On factor width and symmetric \(H\)-matrices
- Local minima and convergence in low-rank semidefinite programming
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Optimal ℓ 1 Rank One Matrix Decomposition
- Closing duality gaps of SDPs completely through perturbation when singularity degree is one
- 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
- On the cone of positive semidefinite matrices
- Applications of the Joint Angular Field of Values
- 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
- On Farkas lemma and dimensional rigidity of bar frameworks
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Solving SDP completely with an interior point oracle
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Diagonally Dominant Principal Component Analysis
- A Scalable Algorithm for Sparse Portfolio Selection
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Eigenvalue-constrained faces
- Primal and polar approach for computing the symmetric diagonally dominant projection
- 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)
