scientific article
From MaRDI portal
Publication:3491318
DOI<499::AID-NAV3220370405>3.0.CO;2-9 10.1002/1520-6750(199008)37:4<499::AID-NAV3220370405>3.0.CO;2-9zbMath0708.90063MaRDI QIDQ3491318
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-boundupper and lower boundsglobal minimizationlarge-scale indefinite quadratic problemsbounded polyhedral setComputational result
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)
Related Items
A reformulation-convexification approach for solving nonconvex quadratic programming problems, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, A branch-and-reduce approach to global optimization, Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations, Box-constrained quadratic programs with fixed charge variables, Global optimization of fractional programs, Reduction of indefinite quadratic programs to bilinear programs, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming, Parallel computing in nonconvex programming, Global optimization algorithms for linearly constrained indefinite quadratic problems
Cites Work
