Gaddum's test for symmetric cones
From MaRDI portal
Publication:2022297
DOI10.1007/s10898-020-00960-6zbMath1465.90064OpenAlexW3095804012MaRDI QIDQ2022297
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00960-6
Convex programming (90C25) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Completely mixed linear games on a self-dual cone
- On the game-theoretic value of a linear transformation relative to a self-dual cone
- Geometry of the copositive and completely positive cones
- Handbook on semidefinite, conic and polynomial optimization
- Some P-properties for linear transformations on Euclidean Jordan algebras
- A new polynomial-time algorithm for linear programming
- Linear inequalities and quadratic forms
- Z-transformations on proper and symmetric cones
- Positive operators on the \(n\)-dimensional ice cream cone
- Self-dual cones in Euclidean spaces
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- On the cone of positive semidefinite matrices
- Existence results for noncoercive mixed variational inequalities in finite dimensional spaces
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- The lattice of faces of a finite dimensional cone
- Relaxations of Combinatorial Problems Via Association Schemes
- A Variational Approach to Copositive Matrices
- The Linear Complementarity Problem
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The cone of Z-transformations on the second order cone
- The Lyapunov rank of an improper cone
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- A Jordan-algebraic approach to potential-reduction algorithms
