A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
From MaRDI portal
Publication:1774170
DOI10.1007/s10107-004-0550-7zbMath1137.90010OpenAlexW2000642309MaRDI QIDQ1774170
Dieter Vandenbussche, Nemhauser, George I.
Publication date: 29 April 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-004-0550-7
Related Items
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, An accelerating algorithm for globally solving nonconvex quadratic programming, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Disjunctive Cuts for Nonconvex MINLP, Linear Programming Relaxations of Quadratically Constrained Quadratic Programs, Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, A note on sufficient global optimality conditions for fixed charge quadratic programs, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Computable representations for convex hulls of low-dimensional quadratic forms, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Cutting Plane Generation through Sparse Principal Component Analysis, Global optimality conditions for fixed charge quadratic programs, Semidefinite relaxations for non-convex quadratic mixed-integer programming, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, On convex relaxations for quadratically constrained quadratic programming, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Convex programming with single separable constraint and bounded variables, Algorithms for linear programming with linear complementarity constraints, Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, (Global) optimization: historical notes and recent developments, Outer-product-free sets for polynomial optimization and oracle-based cuts, Separation and relaxation for cones of quadratic forms, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, Domain reduction techniques for global NLP and MINLP optimization, An LPCC approach to nonconvex quadratic programs, On linear programs with linear complementarity constraints, Outlier detection and least trimmed squares approximation using semi-definite programming, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, Testing copositivity via mixed-integer linear programming, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, Box-constrained quadratic programs with fixed charge variables, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Nonlinear optimization problem of interdependent investment projects portfolio, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, RLT: A unified approach for discrete and continuous nonconvex optimization, Relaxing the optimality conditions of box QP, Globally solving nonconvex quadratic programming problems via completely positive programming, Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm, Quadratic factorization heuristics for copositive programming, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, A polyhedral study of nonconvex quadratic programs with box constraints, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, Solving linear programs with complementarity constraints using branch-and-cut, A new algorithm for the general quadratic programming problems with box constraints, A binarisation heuristic for non-convex quadratic programming with box constraints, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations, Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints, Unnamed Item, A reduced proximal-point homotopy method for large-scale non-convex BQP
Uses Software
Cites Work
- Unnamed Item
- MINTO, a Mixed INTeger Optimizer
- A polyhedral study of nonconvex quadratic programs with box constraints
- BARON: A general purpose global optimization software package
- An Algorithm for Large Zero-One Knapsack Problems
- A Computational Study of Search Strategies for Mixed Integer Programming
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
