|
A path-following infeasible interior-point algorithm for semidefinite programming
|
| |
|
|
|
چکیده: (33146 مشاهده) |
| We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT steps, namely O(nlogn/e) , which is as good as the linear analogue. |
|
| |
|
|
متن کامل [PDF 281 kb]
(39877 دریافت)
|
نوع مطالعه: پژوهشی |
دریافت: 1390/2/22 | پذیرش: 1392/4/1 | انتشار: 1392/4/1
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
