Separating doubly nonnegative and completely positive matrices

DOI10.1007/S10107-011-0485-8zbMath1263.90064OpenAlexW2027671690MaRDI QIDQ1942269

Hongbo Dong, Kurt M. Anstreicher

Publication date: 18 March 2013

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0485-8

zbMATH Keywords

completely positive matricesdoubly nonnegative matrices

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (15)

Cutting planes for semidefinite relaxations based on triangle-free subgraphs ⋮ Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints ⋮ Generating irreducible copositive matrices using the stable set problem ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Separation and relaxation for cones of quadratic forms ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Factorization and cutting planes for completely positive matrices by copositive projection ⋮ Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques ⋮ \(\{0,1\}\) completely positive tensors and multi-hypergraphs ⋮ Unnamed Item ⋮ Geometry of the copositive and completely positive cones ⋮ On \(\{0,1\}\) CP tensors and CP pseudographs ⋮ Copositive Programming ⋮ Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations ⋮ Completely positive reformulations for polynomial optimization

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of completely positive graphs
• \(5 \times 5\) completely positive matrices
• The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs
• A note on ``\(5\times 5\) completely positive matrices
• Almost copositive matrices
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• Completely positive matrices with a book-graph
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• On the copositive representation of binary and continuous nonconvex quadratic programs
• The copositive completion problem
• Computable representations for convex hulls of low-dimensional quadratic forms
• Copositivity cuts for improving SDP bounds on the clique number
• Approximation of the Stability Number of a Graph via Copositive Programming
• On Nonconvex Quadratic Programming with Box Constraints
• An Adaptive Linear Approximation Algorithm for Copositive Programs
• Computing the Stability Number of a Graph Via Linear and Semidefinite Programming

This page was built for publication: Separating doubly nonnegative and completely positive matrices