Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
From MaRDI portal
Publication:5139846
DOI10.1287/IJOC.2018.0883OpenAlexW2963575397WikidataQ127480146 ScholiaQ127480146MaRDI QIDQ5139846FDOQ5139846
Authors: Wei Xia, Luis Fernando Zuluaga, Juan 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
Recommendations
- Global solution of non-convex quadratically constrained quadratic programs
- Globally solving nonconvex quadratic programming problems via completely positive programming
- scientific article; zbMATH DE number 5630592
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- scientific article; zbMATH DE number 1051015
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
- A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- An accelerating algorithm for globally solving nonconvex quadratic programming
global optimizationbranch and boundKKT conditionsmixed integer linear programmingHoffman boundnon-convex quadratic programming
Cites Work
- BARON: A general purpose global optimization software package
- GLOMIQO: global mixed-integer quadratic optimizer
- CUTEr and SifDec
- Title not available (Why is that?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Title not available (Why is that?)
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A mathematical view of interior-point methods in convex optimization
- Semidefinite relaxation and nonconvex quadratic optimization
- Approximations to Solutions to Systems of Linear Inequalities
- An adaptive linear approximation algorithm for copositive programs
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Separating doubly nonnegative and completely positive matrices
- Copositivity cuts for improving SDP bounds on the clique number
- Introduction to global optimization.
- Quadratic programming with one negative eigenvalue is NP-hard
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- On linear programs with linear complementarity constraints
- A clique algorithm for standard quadratic programming
- On standard quadratic optimization problems
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- An interior-point algorithm for nonconvex nonlinear programming
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Hoffman's least error bounds for systems of linear inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exploiting symmetry in copositive programs via semidefinite hierarchies
Cited In (23)
- 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
- New characterizations of Hoffman constants for systems of linear constraints
- Cutting plane generation through sparse principal component analysis
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- A new algorithm for concave quadratic programming
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- Convexification of bilinear forms through non-symmetric lifting
- A novel parallel combinatorial algorithm for multiparametric programming
- quadprogIP
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- A computational study on QP problems with general linear constraints
- A copositive framework for analysis of hybrid Ising-classical algorithms
- Compact mixed-integer programming formulations in quadratic optimization
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Globally solving Non-Convex Quadratic Programs via Linear Integer Programming techniques
- (Global) optimization: historical notes and recent developments
- Performance comparison of two recently proposed copositivity tests
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139846)
