Sufficient global optimality conditions for bivalent quadratic optimization
Pınar, M. Ç.
Journal of Optimization Theory and Applications
433 - 440
Item Usage Stats
MetadataShow full item record
We prove a sufficient global optimality condition for the problem of minimizing a quadratic function subject to quadratic equality constraints where the variables are allowed to take values -1 and 1. We extend the condition to quadratic problems with matrix variables and orthonormality constraints, and in particular to the quadratic assignment problem.
Quadratic assignment problem
Quadratic optimization with binary variables
Sufficient optimality conditions
Published Version (Please cite this version)http://dx.doi.org/10.1023/B:JOTA.0000042530.24671.80
Showing items related by title, author, creator and subject.
Rudloff, B.; Ulus, F.; Vanderbei, R. (Springer, 2017)In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (the Evans–Steuer) algorithm (Math ...
Optimal signaling and detector design for power constrained on-off keying systems in Neyman-Pearson framework Dulek, Berkan; Gezici, Sinan (IEEE, 2011)Optimal stochastic signaling and detector design are studied for power constrained on-off keying systems in the presence of additive multimodal channel noise under the Neyman-Pearson (NP) framework. The problem of jointly ...
Çetin, A. Enis; Bozkurt, Alican; Günay, Osman; Habiboglu, Yusuf Hakan; Köse, K.; Onaran, İbrahim; Tofighi, Mohammad; Sevimli, Rasim Akın (IEEE, 2013)A new optimization technique based on the projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented. The dimension of the minimization problem is lifted by ...