Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
From MaRDI portal
Publication:5139846
DOI10.1287/ijoc.2018.0883OpenAlexW2963575397WikidataQ127480146 ScholiaQ127480146MaRDI QIDQ5139846
Wei Xia, Luis F. Zuluaga, Juan Carlos Vera
Publication date: 11 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.02423
global optimizationbranch and boundmixed integer linear programmingKKT conditionsHoffman boundnon-convex quadratic programming
Related Items
New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ A computational study on QP problems with general linear constraints ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ (Global) optimization: historical notes and recent developments ⋮ Performance comparison of two recently proposed copositivity tests ⋮ A distributionally robust optimization approach for two-stage facility location problems ⋮ Testing copositivity via mixed-integer linear programming ⋮ Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations ⋮ A new algorithm for concave quadratic programming ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems ⋮ Convexification of bilinear forms through non-symmetric lifting ⋮ quadprogIP ⋮ Compact mixed-integer programming formulations in quadratic optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- On linear programs with linear complementarity constraints
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- A clique algorithm for standard quadratic programming
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Quadratic programming with one negative eigenvalue is NP-hard
- On standard quadratic optimization problems
- An interior-point algorithm for nonconvex nonlinear programming
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- BARON: A general purpose global optimization software package
- Separating doubly nonnegative and completely positive matrices
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Hoffman's least error bounds for systems of linear inequalities
- Copositivity cuts for improving SDP bounds on the clique number
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Semidefinite relaxation and nonconvex quadratic optimization
- Approximations to Solutions to Systems of Linear Inequalities
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- CUTEr and SifDec
- Introduction to global optimization.
