
A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
Keywords: برنامه نویسی نیمه تمام; Semidefinite programming; Full Nesterov–Todd steps; Infeasible interior-point methods; Polynomial complexity; Kernel functions