Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
type: Item
instance of: scholarly article
title: Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
zbMATH Open document ID: 0858.90102
DOI: 10.1016/0167-6377(95)00014-B
author: Thai Quynh Phong
author: Le Thi Hoai An
author: Pham Dinh Tao
published in: Operations Research Letters
publication date: 1997-03-23T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 937080
zbMATH Keywords: decomposition branch-and-bound approach
zbMATH Keywords: global minimization
zbMATH Keywords: indefinite quadratic function
zbMATH Keywords: \(w\)-subdivision
MaRDI profile type: Publication
cites work: Q4246783
cites work: Primal-relaxed dual global optimization approach
cites work: On solving a d.c. programming problem by a sequence of linear programs
cites work: Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
cites work: Global minimization of indefinite quadratic problems
cites work: Constrained global optimization: algorithms and applications
cites work: A parallel algorithm for partially separable non-convex global minimization: Linear constraints
cites work: Convergence of a subgradient method for computing the bound norm of matrices
cites work: Q3772809
cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
description: scientific article; zbMATH DE number 937080