IDEAS home Printed from https://ideas.repec.org/p/cvh/coecwp/2021-06.html
   My bibliography  Save this paper

A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation

Author

Listed:
  • E. Nagy, Marianna
  • Varga, Anita

Abstract

In this paper, we investigate a new primal-dual long-step interior point algorithm for linear optimization. Based on the step-size, interior point algorithms can be divided into two main groups, short-step and long-step methods. In practice, long-step variants perform better, but usually, a better theoretical complexity can be achieved for the short-step methods. One of the exceptions is the large-update algorithm of Ai and Zhang. The new wide neighbourhood and the main characteristics of the presented algorithm are based on their approach. In addition, we use the algebraic equivalent transformation technique by Darvay to determine the search directions of the method.

Suggested Citation

  • E. Nagy, Marianna & Varga, Anita, 2021. "A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation," Corvinus Economics Working Papers (CEWP) 2021/06, Corvinus University of Budapest.
  • Handle: RePEc:cvh:coecwp:2021/06
    as

    Download full text from publisher

    File URL: https://unipub.lib.uni-corvinus.hu/6771/
    File Function: original version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Y. Q. Bai & G. Lesaja & C. Roos & G. Q. Wang & M. El Ghami, 2008. "A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 138(3), pages 341-359, September.
    2. Nikolaos Ploskas & Nikolaos Samaras, 2017. "Correction to: Linear Programming Using MATLAB®," Springer Optimization and Its Applications, in: Linear Programming Using MATLAB®, pages E1-E3, Springer.
    3. Ilan Adler & Narendra Karmarkar & Mauricio G. C. Resende & Geraldo Veiga, 1989. "Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm," INFORMS Journal on Computing, INFORMS, vol. 1(2), pages 84-106, May.
    4. Zsolt Darvay & Petra Renáta Takács, 2018. "Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 551-563, September.
    5. Nikolaos Ploskas & Nikolaos Samaras, 2017. "Linear Programming Using MATLAB®," Springer Optimization and Its Applications, Springer, number 978-3-319-65919-0, December.
    6. Zs. Darvay & T. Illés & B. Kheirfam & P. R. Rigó, 2020. "A corrector–predictor interior-point method with new search direction for linear optimization," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 1123-1140, September.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Janez Povh & Lidija Zadnik Stirn & Janez Žerovnik, 2023. "60 years of OR in Slovenia: development from a first conference to a vibrant community," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(3), pages 681-690, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jeffery L. Kennington & Karen R. Lewis, 2004. "Generalized Networks: The Theory of Preprocessing and an Empirical Analysis," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 162-173, May.
    2. Jae Hyoung Lee & Nithirat Sisarat & Liguo Jiao, 2021. "Multi-objective convex polynomial optimization and semidefinite programming relaxations," Journal of Global Optimization, Springer, vol. 80(1), pages 117-138, May.
    3. Ndayikengurutse Adrien & Huang Siming, 2020. "Implementation of Presolving and Interior-Point Algorithm for Linear & Mixed Integer Programming: SOFTWARE," Journal of Systems Science and Information, De Gruyter, vol. 8(3), pages 195-223, June.
    4. Mohand Bentobache & Mohamed Telli & Abdelkader Mokhtari, 2022. "New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming," Journal of Global Optimization, Springer, vol. 82(4), pages 659-689, April.
    5. Marianna E.-Nagy & Anita Varga, 2024. "A New Ai–Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 76-107, July.
    6. Sophia Voulgaropoulou & Nikolaos Samaras & Nikolaos Ploskas, 2022. "Predicting the Execution Time of the Primal and Dual Simplex Algorithms Using Artificial Neural Networks," Mathematics, MDPI, vol. 10(7), pages 1-21, March.
    7. Botond Bertók & Tibor Csendes & Tibor Jordán, 2019. "Editorial," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 325-327, June.
    8. Zsolt Darvay & Petra Renáta Takács, 2018. "Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 551-563, September.
    9. Darvay, Zsolt & Illés, Tibor & Rigó, Petra Renáta, 2022. "Predictor-corrector interior-point algorithm for P*(κ)-linear complementarity problems based on a new type of algebraic equivalent transformation technique," European Journal of Operational Research, Elsevier, vol. 298(1), pages 25-35.
    10. Botond Bertok & Péter Biró & Marianna E.-Nagy, 2024. "Overview of Hungarian operations research based on the VOCAL 2022 conference," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 32(4), pages 897-902, December.
    11. Milan Dražić & Rade Lazović & Vera Kovačević-Vujčić, 2015. "Sparsity preserving preconditioners for linear systems in interior-point methods," Computational Optimization and Applications, Springer, vol. 61(3), pages 557-570, July.
    12. Maros, Istvan & Haroon Khaliq, Mohammad, 2002. "Advances in design and implementation of optimization software," European Journal of Operational Research, Elsevier, vol. 140(2), pages 322-337, July.
    13. Botond Bertók & Tibor Csendes & Gábor Galambos, 2021. "Operations research in Hungary: VOCAL 2018," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 379-386, June.
    14. Jingyong Tang & Jinchuan Zhou, 2021. "Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem," Computational Optimization and Applications, Springer, vol. 80(1), pages 213-244, September.
    15. Manuel V. C. Vieira, 2012. "The Accuracy of Interior-Point Methods Based on Kernel Functions," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 637-649, November.
    16. G. Q. Wang & Y. Q. Bai, 2012. "A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 739-772, March.
    17. G. Lesaja & C. Roos, 2011. "Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 150(3), pages 444-474, September.

    More about this item

    Keywords

    Mathematical programming; Linear optimization; Interior point algorithms; Algebraic equivalent transformation technique;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:cvh:coecwp:2021/06. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Adam Hoffmann (email available below). General contact details of provider: https://edirc.repec.org/data/bkeeehu.html .

    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.