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. 1 / 2014  
         
  Article:   AN INFEASIBLE FULL-NEWTON STEP ALGORITHM FOR LINEAR OPTIMIZATION WITH ONE CENTERING STEP IN MAJOR ITERATION.

Authors:  ZSOLT DARVAY.
 
       
         
  Abstract:   Recently, Roos proposed a full-Newton step infeasible interior-point method (IIPM) for solving linear optimization (LO) problems. Later on, more variants of this algorithm were published. However, each main step of these methods is composed of one feasibility step and several centering steps. The purpose of this paper is to prove that by using a new search direction it is enough to take only one centering step in order to obtain a polynomial-time method. This algorithm has the same complexity as the best known IIPMs. 

2010 Mathematics Subject Classi fication. 90C05, 90C51.1998 CR Categories and Descriptors. G.1.6. [Mathematics of Computing]: Numerical Analysis - Optimization - Linear programming.

Key words and phrases. Linear optimization, Infeasible interior-point method, Newton`s method, Polynomial complexity.
 
         
     
         
         
      Back to previous page