Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints

Title: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
Creator: Wu, Zhiyou; Jeyakumar, Vaithilingam; Rubinov, Alex
Date: 2007
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/63572
Identifier: vital:953
Identifier: https://doi.org/10.1007/s10957-007-9177-1
Identifier: ISSN:0022-3239
Abstract: We present sufficient conditions for the global optimality of bivalent nonconvex quadratic programs involving quadratic inequality constraints as well as equality constraints. By employing the Lagrangian function, we extend the global subdifferential approach, developed recently in Jeyakumar et al. (J. Glob. Optim., 2007, to appear; Math. Program. Ser. A, 2007, to appear) for studying bivalent quadratic programs without quadratic constraints, and derive global optimality conditions. © 2007 Springer Science+Business Media, LLC.; C1
Publisher: Springer
Relation: Journal of Optimization Theory and Applications Vol. 133, no. 1 (2007), p. 123-130
Rights: Copyright Springer
Rights: This metadata is freely available under a CCO license
Subject: 0802 Computation Theory and Mathematics; Binary constraints; Global optimality; Quadratic inequality constraints; Quadratic optimisation; Sufficient conditions
Reviewed

		Thumbnail	File	Description	Size	Format