Testing copositivity via mixed-integer linear programming

DOI10.1016/J.LAA.2020.09.002zbMath1459.90132OpenAlexW3084359136WikidataQ114851450 ScholiaQ114851450MaRDI QIDQ2226458

Kurt M. Anstreicher

Publication date: 12 February 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2020.09.002

zbMATH Keywords

copositive programmingcopositive matrixmixed integer linear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (4)

An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Performance comparison of two recently proposed copositivity tests ⋮ Conic formulation of QPCCs applied to truly sparse QPs ⋮ A copositive framework for analysis of hybrid Ising-classical algorithms

Uses Software

• quadprogIP

Cites Work

• Copositive matrices with circulant zero support set
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• An improved algorithm to test copositivity
• On the computational complexity of membership problems for the completely positive cone and its dual
• Almost copositive matrices
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• On copositive matrices
• A gentle, geometric introduction to copositive optimization
• On the copositive representation of binary and continuous nonconvex quadratic programs
• A new certificate for copositivity
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Algorithmic copositivity detection by simplicial partition
• Approximation of the Stability Number of a Graph via Copositive Programming
• A Variational Approach to Copositive Matrices
• Some NP-complete problems in quadratic and nonlinear programming
• Cliques in random graphs
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Computing the Stability Number of a Graph Via Linear and Semidefinite Programming

This page was built for publication: Testing copositivity via mixed-integer linear programming