On a class of interior point algorithms
    
    
  
  
  
      
      
      
        
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 12, pp. 2114-2130
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              A family of interior point algorithms for solving linear programs is examined. Under the assumption on the nondegeneracy of the problem, a theoretical justification of these algorithms is given. The sets of the algorithms converging to relatively interior optimal solutions and having linear or superlinear convergence rate are identified.
            
            
            
          
        
      @article{ZVMMF_2009_49_12_a2,
     author = {V. I. Zorkal'tsev},
     title = {On a~class of interior point algorithms},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {2114--2130},
     publisher = {mathdoc},
     volume = {49},
     number = {12},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_12_a2/}
}
                      
                      
                    V. I. Zorkal'tsev. On a class of interior point algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 49 (2009) no. 12, pp. 2114-2130. http://geodesic.mathdoc.fr/item/ZVMMF_2009_49_12_a2/
