Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
From MaRDI portal
Publication:2231320
DOI10.1007/s10898-021-01017-yOpenAlexW3155519467MaRDI QIDQ2231320
Jacek Gondzio, E. Alper Yıldırım
Publication date: 29 September 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.02307
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
On monotonicity and search strategies in face-based copositivity detection algorithms, (Global) optimization: historical notes and recent developments, Performance comparison of two recently proposed copositivity tests, Optimization of a quadratic programming problem over an Integer efficient set, A new algorithm for concave quadratic programming, Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems, Two-stage stochastic standard quadratic optimization, A study on sequential minimal optimization methods for standard quadratic problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- An LPCC approach to nonconvex quadratic programs
- On the computational complexity of membership problems for the completely positive cone and its dual
- Branch-and-bound approaches to standard quadratic optimization problems
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A clique algorithm for standard quadratic programming
- On standard quadratic optimization problems
- A new semidefinite programming bound for indefinite quadratic forms over a simplex
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A polyhedral branch-and-cut approach to global optimization
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Solving linear programs with complementarity constraints using branch-and-cut
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- D.C. versus copositive bounds for standard QP
- Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
- Branching and bounds tighteningtechniques for non-convex MINLP
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Continuous Characterizations of the Maximum Clique Problem
- Solving Quadratic Programming by Cutting Planes
- A new branch-and-bound algorithm for standard quadratic programming problems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On copositive programming and standard quadratic optimization problems
- Benchmarking optimization software with performance profiles.
