A reformulation-convexification approach for solving nonconvex quadratic programming problems Hanif D. SheraliCihan H. Tuncbilek OriginalPaper Pages: 1 - 31
Some geometric results in semidefinite programming Motakuri RamanaA. J. Goldman OriginalPaper Pages: 33 - 50
A recipe for semidefinite relaxation for (0,1)-quadratic programming S. PoljakF. RendlH. Wolkowicz OriginalPaper Pages: 51 - 73
On global maximum of a convex terminal functional in optimal control problems A. S. Strekalovsky OriginalPaper Pages: 75 - 91
Towards Pure Adaptive Search W. P. BaritompaZhang BaopingZ. B. Zabinsky OriginalPaper Pages: 93 - 110