Logarithmic Barrier Function Method for Convex Quadratic Programming Problem

  •  Xinghua Wang    
  •  Wen Liu    
  •  Pingping Qin    
  •  Lifeng Sun    


In this paper, we present a kind of interior point algorithm for solving Convex Quadratic Programming problem using Logarithmic Barrier Function. In which Newton Method and Interior Penalty Function Method are combined to obtain a simple construct and easily calculating algorithm. In each iterate it needs only to solve an equality constrained Quadratic Programming problem.  

This work is licensed under a Creative Commons Attribution 4.0 License.