A class of new search directions for full-NT step feasible interior point method in semidefinite optimization.

Published in: RAIRO Oper. Res. (2022)

Keyphrases

semidefinite
interior point methods
semidefinite programming
convex optimization
linear programming
linear program
primal dual
quadratic programming
convex relaxation
sufficient conditions
computationally intensive
convex sets
solving problems
finite dimensional
np hard
denoising