Solving Quadratic Programming by Cutting Planes
From MaRDI portal
Publication:4634098
DOI10.1137/16M107428XzbMath1411.90247OpenAlexW2939980816MaRDI QIDQ4634098
Andrea Lodi, Pierre Bonami, Andrea Tramontani, Jonas Schweiger
Publication date: 7 May 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m107428x
global optimizationnonconvex programmingcutting planesreformulation-linearization techniquestandard quadratic programming
Related Items
Cutting Plane Generation through Sparse Principal Component Analysis, (Global) optimization: historical notes and recent developments, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, A logarithmic descent direction algorithm for the quadratic knapsack problem, Continuous cubic formulations for cluster detection problems in networks, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
Uses Software
Cites Work
- GLOMIQO: global mixed-integer quadratic optimizer
- Bilevel programming and the separation problem
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A clique algorithm for standard quadratic programming
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A new reformulation-linearization technique for bilinear programming problems
- On standard quadratic optimization problems
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- On convex relaxations for quadratically constrained quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Bilevel Knapsack with Interdiction Constraints
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Quadratic knapsack problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Continuous Characterizations of the Maximum Clique Problem
- Exact Solution of the Quadratic Knapsack Problem
- Reducibility among Combinatorial Problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Mixed-integer nonlinear optimization
- On copositive programming and standard quadratic optimization problems
- Benchmarking optimization software with performance profiles.
- Copositivity tests based on the linear complementarity problem
