Extended triangle inequalities for nonconvex box-constrained quadratic programming

DOI10.1007/S10898-026-01644-3MaRDI QIDQ7411482zbMATH OpenFDO

Authors Kurt M. Anstreicher, Diane Puges

Publication date 2026

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-026-01644-3

zbMATH Keywords

box-constrained quadratic programmingnonconvex quadratic programmingtriangle inequalities

Mathematics Subject Classification ID

Stochastic programming (90C15) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Cites work

• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• BARON: A general purpose global optimization software package
• Computable representations for convex hulls of low-dimensional quadratic forms
• Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
• Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
• Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
• Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
• On convex relaxations for quadratically constrained quadratic programming
• On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
• On nonconvex quadratic programming with box constraints
• Quantifying double McCormick
• Separating doubly nonnegative and completely positive matrices
• Symmetric tensor approximation hierarchies for the completely positive cone
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Triangulations. Structures for algorithms and applications
• Using general triangle inequalities within quadratic convex reformulation method
• Using quadratic cuts to iteratively strengthen convexifications of box quadratic programs

This page was built for publication: Extended triangle inequalities for nonconvex box-constrained quadratic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411482)