Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
From MaRDI portal
Publication:2146997
Recommendations
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- On linear conic relaxation of discrete quadratic programs
- On equivalence of semidefinite relaxations for quadratic matrix programming
Cites work
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 3201668 (Why is no real title available?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- An adaptive linear approximation algorithm for copositive programs
- An improved characterisation of the interior of the completely positive cone
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
- Branch-and-price: Column generation for solving huge integer programs
- CSDP, A C library for semidefinite programming
- Column Generation
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Copositive optimization -- recent developments and applications
- Copositive programming
- Decomposition Principle for Linear Programs
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Geometry of the copositive and completely positive cones
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
- Interior points of the completely positive cone
- LP formulations for polynomial optimization problems
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- On copositive programming and standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the cut polytope
- On the solution of a graph partitioning problem under capacity constraints
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Positive definite completions of partial Hermitian matrices
- QPLIB: a library of quadratic programming instances
- Quadratic factorization heuristics for copositive programming
- Semidefinite programming
- Semidefinite programming and integer programming
- Semidefinite relaxations for integer programming
- Solving semidefinite-quadratic-linear programs using SDPT3
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The completely positive and doubly nonnegative completion problems
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
This page was built for publication: Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146997)
