On the identification of the optimal partition for semidefinite optimization.

Ali Mohammad Nezhad Tamás Terlaky

Published in: INFOR Inf. Syst. Oper. Res. (2020)

Keyphrases

semidefinite
semidefinite programming
monotonicity property
convex relaxation
sufficient conditions
higher dimensional
interior point methods
optimal solution
dynamic programming
optimization problems
linear programming
optimization algorithm
globally optimal
high dimensional
special case
maximum margin