Cai Xin-zhong
Abstract
A perturbed problem for semidefinite programming problem was constructed.Compared with the standard problem for semidefinite programming,the perturbed problem has a strictly feasible solution.This was mainly applied to designing and analyzing the infeasible interior-point algorithm for semidefinite programming.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A perturbed problem for semidefinite programming problem was constructed.Compared with the standard problem for semidefinite programming,the perturbed problem has a strictly feasible solution.This was mainly applied to designing and analyzing the infeasible interior-point algorithm for semidefinite programming.
Key concepts: Semidefinite programming, Semidefinite embedding, Quadratically constrained quadratic program, Mathematical optimization, Interior point method, Second-order cone programming, Large margin nearest neighbor, Linear programming