Electronic Resource
Springer
Journal of global optimization
2 (1992), S. 201-208
ISSN:
1573-2916
Keywords:
Global optimization
;
quadratic program
;
lower bound
;
branch and bound
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In this paper we prove a sufficient condition that a strong local minimizer of a bounded quadratic program is the unique global minimizer. This sufficient condition can be verified computationally by solving a linear and a convex quadratic program and can be used as a quality test for local minimizers found by standard indefinite quadratic programming routines.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00122055
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |