On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
From MaRDI portal
Publication:4888148
DOI10.1051/ro/1996300100311zbMath0857.90098OpenAlexW2526272609MaRDI QIDQ4888148
Thai Quynh Phong, Tao Pham Dinh, Hoai An Le Thi
Publication date: 30 October 1996
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105118
global minimizationbounded polyhedral setconvex underestimating functionindefinite quadratic functiondecomposition branch-and-bound approach
Related Items (8)
DC programming techniques for solving a class of nonlinear bilevel programs ⋮ Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions ⋮ A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks ⋮ An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs ⋮ New formulations of the multiple sequence alignment problem ⋮ A branch-and-bound algorithm embedded with DCA for DC programming ⋮ An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial ⋮ Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
Uses Software
This page was built for publication: On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
