On monotonicity and search strategies in face-based copositivity detection algorithms

DOI10.1007/s10100-021-00737-6OpenAlexW3134034467MaRDI QIDQ2155140

Leocadio G. Casado, Eligius M. T. Hendrix, Boglárka G.-Tóth

Publication date: 15 July 2022

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-021-00737-6

zbMATH Keywords

facemonotonecopositive matrixstandard simplex

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

(Global) optimization: historical notes and recent developments

Cites Work

• Unnamed Item
• A clique algorithm for standard quadratic programming
• Algorithms for determining the copositivity of a given symmetric matrix
• Criteria for copositive matrices
• A new semidefinite programming bound for indefinite quadratic forms over a simplex
• A test for copositive matrices
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Algorithmic copositivity detection by simplicial partition
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique
• Some NP-complete problems in quadratic and nonlinear programming
• A new branch-and-bound algorithm for standard quadratic programming problems
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
• A Copositive Programming Approach to Graph Partitioning

This page was built for publication: On monotonicity and search strategies in face-based copositivity detection algorithms