Login / Signup
A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization.
Yan-Qin Bai
F. Y. Wang
X. W. Luo
Published in:
RAIRO Oper. Res. (2010)
Keyphrases
</>
semidefinite
interior point methods
semidefinite programming
convex relaxation
convex optimization
primal dual
linear programming
special case
sufficient conditions
linear program
worst case
learning algorithm
evolutionary algorithm
np hard
nonlinear programming