Loading...

An improved infeasible interior-point method for symmetric cone linear complementarity problem

Kheirfam, B ; Sharif University of Technology

314 Viewed
  1. Type of Document: Article
  2. Publisher: Iranian Mathematical Society
  3. Abstract:
  4. In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three-centering steps. Here, each iteration consists of only a feasibility step. Thus, the new algorithm demands less work in each iteration and admits a simple analysis of complexity bound. The complexity result coincides with the best-known iteration bound for infeasible interior-point methods
  5. Keywords:
  6. Infeasible interior-point method ; Linear complementarity problem ; Polynomial complexity ; Symmetric cones
  7. Source: Bulletin of the Iranian Mathematical Society ; Volume 42, Issue 7 Special Issue , 2016 , Pages 55-66 ; 10186301 (ISSN)
  8. URL: http://bims.iranjournals.ir/article_888.html