A filled function method for quadratic programs with binary constraints

Title: A filled function method for quadratic programs with binary constraints
Creator: Wu, Zhiyou; Yang, Y. J.; Bai, Fusheng
Date: 2009
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/59639
Identifier: vital:2138
Identifier: https://doi.org/10.1080/02331930902928757
Identifier: ISSN:0233-1934
Abstract: In this article, we first introduce a definition of a local minimizer for the quadratic programs with {-1, 1} constraints and show that the existing necessary condition of global optimality in some recent literature is in fact the necessary and sufficient condition of local optimality under the present definition. A filled function and the corresponding filled function algorithm then are proposed to get the global minimizer of the concerned minimization problem. The existing sufficient condition of global optimality is employed to form one of the termination rules of the algorithm. Several numerical examples are reported to show the efficiency of the present method for solving quadratic programs with binary constraints.
Relation: Optimization Vol. 58, no. 5 (2009), p. 585-598
Rights: Copyright Taylor & Francis
Rights: This metadata is freely available under a CCO license
Subject: Quadratic programs; Binary constraints; Filled function method; Global; Optimization; Global optimality conditions
Reviewed

		Thumbnail	File	Description	Size	Format