Loading...

New complexity analysis of a full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization

Kheirfam, B ; Sharif University of Technology | 2013

338 Viewed
  1. Type of Document: Article
  2. Publisher: 2013
  3. Abstract:
  4. A full Nesterov-Todd step infeasible interior-point algorithm is proposed for solving linear programming problems over symmetric cones by using the Euclidean Jordan algebra. Using a new approach, we also provide a search direction and show that the iteration bound coincides with the best known bound for infeasible interior-point methods
  5. Keywords:
  6. Euclidean Jordan algebra ; Interior-point methods ; Polynomial complexity ; Symmetric cone optimization
  7. Source: Kybernetika ; Volume 49, Issue 6 , 2013 , Pages 883-896 ; 00235954 (ISSN)
  8. URL: http://www.kybernetika.cz/content/2013/6/883