Abstract
This paper is concerned with the boolean quadratic optimization problem. We formulate and analyze a class of non-convex relaxation problems which includes the relaxation problem with complex variables and the SDP relaxation problem as special cases. The effects of expanding the parameter space of decision variables to a space of hypercomplex number are investigated. It is shown that for any instance of problem data the relaxation problem in complex variable is the strongest non-convex relaxation among the relaxations (in our formulation) under the condition of having “monotonically decreasing path” which connects any two feasible solutions of the original problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transactions of the Institute of Systems, Control and Information Engineers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
