Completely positive and copositive program modelling for quadratic optimization problems
From MaRDI portal
Publication:5151542
DOI10.1080/02331934.2020.1712392zbMath1460.90124OpenAlexW2999232365MaRDI QIDQ5151542
No author found.
Publication date: 19 February 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1712392
mixed-integer quadratic programmingcompletely positive and copositive programsquadratic multidimensional knapsack problems
Related Items (2)
A simplified completely positive reformulation for binary quadratic programs ⋮ Strong duality for general quadratic programs with quadratic equality constraints
Cites Work
- Unnamed Item
- On conic QPCCs, conic QCQPs and completely positive programs
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- The quadratic knapsack problem -- a survey
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Quadratic programming with one negative eigenvalue is NP-hard
- Simplified semidefinite and completely positive relaxations
- A gentle, geometric introduction to copositive optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Algorithmic copositivity detection by simplicial partition
- Lectures on Modern Convex Optimization
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
- Adaptive computable approximation to cones of nonnegative quadratic functions
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams
- Introduction to global optimization.
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Completely positive and copositive program modelling for quadratic optimization problems
