An extended semi-definite programming, the SDP with an additional quadratic
term in the objective function, is studied. Our generalization is similar
to the generalization from linear programming to quadratic programming. Opt
imal conditions for this new class of problems are discussed and a potentia
l reduction algorithm for solving QSDP problems is presented. The convergen
ce properties of this algorithm are also given.