IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v170y2016i2d10.1007_s10957-016-0895-0.html
   My bibliography  Save this article

An Efficient Primal–Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term

Author

Listed:
  • Mousaab Bouafia

    (University of 8 May 1945 Guelma
    Normandie University)

  • Djamel Benterki

    (University Setif 1)

  • Adnan Yassine

    (Normandie University)

Abstract

In this paper, we present a primal–dual interior point method for linear optimization problems based on a new efficient kernel function with a trigonometric barrier term. We derive the complexity bounds for large and small-update methods, respectively. We obtain the best known complexity bound for large update, which improves significantly the so far obtained complexity results based on a trigonometric kernel function given by Peyghami et al. The results obtained in this paper are the first to reach this goal.

Suggested Citation

  • Mousaab Bouafia & Djamel Benterki & Adnan Yassine, 2016. "An Efficient Primal–Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 528-545, August.
    • Handle: RePEc:spr:joptap:v:170:y:2016:i:2:d:10.1007_s10957-016-0895-0
    DOI: 10.1007/s10957-016-0895-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-0895-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-016-0895-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fabio Vitor & Todd Easton, 2022. "Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming," Computational Optimization and Applications, Springer, vol. 83(1), pages 211-246, September.
    2. Sajad Fathi-Hafshejani & Alireza Fakharzadeh Jahromi & Mohammad Reza Peyghami & Shengyuan Chen, 2018. "Complexity of Interior Point Methods for a Class of Linear Complementarity Problems Using a Kernel Function with Trigonometric Growth Term," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 935-949, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:170:y:2016:i:2:d:10.1007_s10957-016-0895-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.