[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
:: Volume 3, Issue 1 (4-2012) ::
IJOR 2012, 3(1): 11-30 Back to browse issues page
A path-following infeasible interior-point algorithm for semidefinite programming
Mansouri , Siyavash , Zangiabadi
Abstract:   (13468 Views)
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.
Keywords: Semidefinite optimization, infeasible interior-point method, primal-dual method, polynomial complexity
Full-Text [PDF 281 kb]   (3702 Downloads)    
Type of Study: Original |
Received: 2011/05/12 | Accepted: 2013/06/22 | Published: 2013/06/22
Add your comments about this article
Your username or Email:

CAPTCHA code


XML     Print



Volume 3, Issue 1 (4-2012) Back to browse issues page
مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.09 seconds with 30 queries by YEKTAWEB 3752