【 以下文字转载自 CS 讨论区 】
发信人: csresearcher (life for research), 信区: CS
标 题: About QCQP optimization problem
发信站: BBS 未名空间站 (Sun Dec 18 21:03:17 2005)
Does anyone know how to solve the Quadratically Constrained Quadratic
Programming problem? (Suppose the objective and constraint functions are
convex)
Can this be solved in poly-nomial time?
Any link on refereces will be highly appreciated!
Thanks!