• DocumentCode
    3314622
  • Title

    The Complexity Analysis of an Efficient Interior-Point Algorithm for Linear Optimization

  • Author

    Liu, Liying ; Fan, Liya

  • Author_Institution
    Coll. of Math. Sci., Liaocheng Univ., Liaocheng, China
  • Volume
    2
  • fYear
    2010
  • fDate
    28-31 May 2010
  • Firstpage
    21
  • Lastpage
    24
  • Abstract
    In this paper, an efficient primal-dual interior point algorithm for large-update methods is introduced by means of a new kernel function. We analysis the complexity of the algorithm and conclude that its iteration bounds, O(n34 log n?? ), is so far the best complexity result for large update primal-dual interior-point methods.
  • Keywords
    Algorithm design and analysis; Educational institutions; Kernel; Mathematics; Optimization methods; Performance analysis; Polynomials; Interior-point algorithm; Iteration bounds; Kernel function; Linear Optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
  • Conference_Location
    Huangshan, Anhui, China
  • Print_ISBN
    978-1-4244-6812-6
  • Electronic_ISBN
    978-1-4244-6813-3
  • Type

    conf

  • DOI
    10.1109/CSO.2010.36
  • Filename
    5533121
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3314622