Title: A Primal-Dual Infeasible Interior Point Algorithm for Semidefinite Programming
Abstract: A primal-dual infeasible interior point algorithm for semidefinite programming was proposed.It is proved that this algorithm can either get an approximate optimal solution,or get the conclusion that there is no solution of the problem in a large region,after finite iterations.
Publication Year: 2006
Publication Date: 2006-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot