The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

  
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2015  
         
  Article:   AN INFEASIBLE INTERIOR-POINT METHOD FOR THE CARTESIAN P*(K) SECOND-ORDER CONE LINEAR COMPLEMENTARITY PROBLEM WITH ONE CENTERING STEP.

Authors:  . 		 
       
         
  Abstract:   In this paper, we present a new full step infeasible interior-point algorithm for the Cartesian P*(K) linear complementarity problem over second-order cones. The algorithm uses only full Nesterov and Toddsteps. Each (main) iteration of the algorithm consists of one so-called feasibility step and only one centering step. The algorithm starts with a strictly feasible point of a perturbed problem, after an iteration, the new iterate is still strictly feasible of the new perturbed problem. The algorithm has the same complexity as the best known infeasible interior-point methods.

2010 Mathematics Subject Classi fication. 90C51, 90C33.
Key words and phrases. The Cartesian product of second-order cones, Linear comple-mentarity problem, Infeasible interior-point method, Polynomial complexity.
 
         
     
         
         
      Back to previous page