On finding a generalized lowest rank solution to a linear semi-definite feasibility problem.

Published in: Oper. Res. Lett. (2015)

Keyphrases

semidefinite
semidefinite programming
interior point methods
higher dimensional
convex relaxation
linear programming
finite dimensional
convex sets
simulated annealing
sufficient conditions
optimization method
learning algorithm
linear systems
numerical solution
supervised learning
np hard
feature selection