On Nonconvex Quadratic Programming with Box Constraints

DOI10.1137/080729529zbMath1201.90146OpenAlexW2125772126WikidataQ57702234 ScholiaQ57702234MaRDI QIDQ3563922

Samuel Burer, Adam N. Letchford

Publication date: 1 June 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080729529

zbMATH Keywords

global optimizationnonconvex quadrating programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (28)

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ Linear Programming Relaxations of Quadratically Constrained Quadratic Programs ⋮ On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study ⋮ On the microeconomic foundations of linear demand for differentiated products ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ 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 ⋮ Imposing symmetry in augmented linear systems ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ (Global) optimization: historical notes and recent developments ⋮ Separating doubly nonnegative and completely positive matrices ⋮ Separation and relaxation for cones of quadratic forms ⋮ A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow ⋮ Unbounded convex sets for non-convex mixed-integer quadratic programming ⋮ Convex and concave envelopes: revisited and new perspectives ⋮ Extended formulations for convex envelopes ⋮ A guide to conic optimisation and its applications ⋮ Valid inequalities for quadratic optimisation with domain constraints ⋮ Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard ⋮ A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ Quadratic optimization with switching variables: the convex hull for \(n=2\) ⋮ Extended formulations for convex hulls of some bilinear functions ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs

This page was built for publication: On Nonconvex Quadratic Programming with Box Constraints