IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v83y2022i1d10.1007_s10589-022-00385-9.html
   My bibliography  Save this article

Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming

Author

Listed:
  • Fabio Vitor

    (University of Nebraska at Omaha)

  • Todd Easton

    (The University of Utah)

Abstract

The vast majority of linear programming interior point algorithms successively move from an interior solution to an improved interior solution by following a single search direction, which corresponds to solving a one-dimensional subspace linear program at each iteration. On the other hand, two-dimensional search interior point algorithms select two search directions, and determine a new and improved interior solution by solving a two-dimensional subspace linear program at each step. This paper presents primal and dual two-dimensional search interior point algorithms derived from affine and logarithmic barrier search directions. Both search directions are determined by randomly partitioning the objective function into two orthogonal vectors. Computational experiments performed on benchmark instances demonstrate that these new methods improve the average CPU time by approximately 12% and the average number of iterations by 14%.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:coopap:v:83:y:2022:i:1:d:10.1007_s10589-022-00385-9
    DOI: 10.1007/s10589-022-00385-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-022-00385-9
    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/s10589-022-00385-9?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.

    References listed on IDEAS

    as
    1. 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.
    2. Paul T. Boggs & Paul D. Domich & Janet R. Donaldson & Christoph Witzgall, 1989. "Algorithmic Enhancements to the Method of Centers for Linear Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 159-171, August.
    3. Alireza Asadi & Cornelis Roos, 2016. "Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 562-590, August.
    4. Yaguang Yang, 2013. "A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 859-873, September.
    5. Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
    6. Fabio Vitor & Todd Easton, 2018. "The double pivot simplex method," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 109-137, February.
    7. Luiz-Rafael Santos & Fernando Villas-Bôas & Aurelio R. L. Oliveira & Clovis Perin, 2019. "Optimized choice of parameters in interior-point methods for linear programming," Computational Optimization and Applications, Springer, vol. 73(2), pages 535-574, June.
    8. Takashi Tsuchiya, 1992. "Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems," Mathematics of Operations Research, INFORMS, vol. 17(3), pages 527-557, August.
    9. Illes, Tibor & Terlaky, Tamas, 2002. "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, Elsevier, vol. 140(2), pages 170-190, July.
    Full references (including those not matched with items on IDEAS)

    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. Fabio Vitor & Todd Easton, 2018. "The double pivot simplex method," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 109-137, February.
    2. Liu, Yanwu & Tu, Yan & Zhang, Zhongzhen, 2021. "The row pivoting method for linear programming," Omega, Elsevier, vol. 100(C).
    3. Luciana Casacio & Aurelio R. L. Oliveira & Christiano Lyra, 2018. "Using groups in the splitting preconditioner computation for interior point methods," 4OR, Springer, vol. 16(4), pages 401-410, December.
    4. Bittencourt, Tiberio & Ferreira, Orizon Pereira, 2015. "Local convergence analysis of Inexact Newton method with relative residual error tolerance under majorant condition in Riemannian manifolds," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 28-38.
    5. Csizmadia, Zsolt & Illés, Tibor & Nagy, Adrienn, 2012. "The s-monotone index selection rules for pivot algorithms of linear programming," European Journal of Operational Research, Elsevier, vol. 221(3), pages 491-500.
    6. M. Pirhaji & M. Zangiabadi & H. Mansouri, 2017. "An $$\ell _{2}$$ ℓ 2 -neighborhood infeasible interior-point algorithm for linear complementarity problems," 4OR, Springer, vol. 15(2), pages 111-131, June.
    7. Stefania Bellavia & Valentina De Simone & Daniela di Serafino & Benedetta Morini, 2016. "On the update of constraint preconditioners for regularized KKT systems," Computational Optimization and Applications, Springer, vol. 65(2), pages 339-360, November.
    8. Oliver de Groot & Falk Mazelis & Roberto Motto & Annukka Ristiniemi, "undated". "A Toolkit for Computing Constrained Optimal Policy Projections (COPPs)," Working Papers 202112, University of Liverpool, Department of Economics.
    9. Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink, 2022. "On a Reduction for a Class of Resource Allocation Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1387-1402, May.
    10. Michaël Allouche & Emmanuel Gobet & Clara Lage & Edwin Mangin, 2023. "Structured Dictionary Learning of Rating Migration Matrices for Credit Risk Modeling," Working Papers hal-03715954, HAL.
    11. Enrico Bettiol & Lucas Létocart & Francesco Rinaldi & Emiliano Traversi, 2020. "A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs," Computational Optimization and Applications, Springer, vol. 75(2), pages 321-360, March.
    12. Dominik Garmatter & Margherita Porcelli & Francesco Rinaldi & Martin Stoll, 2023. "An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations," Computational Optimization and Applications, Springer, vol. 84(1), pages 191-223, January.
    13. Gondzio, Jacek, 2016. "Crash start of interior point methods," European Journal of Operational Research, Elsevier, vol. 255(1), pages 308-314.
    14. Adrienn Csizmadia & Zsolt Csizmadia & Tibor Illés, 2018. "Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied," 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 535-550, September.
    15. Syed Inayatullah & Nasir Touheed & Muhammad Imtiaz, 2015. "A Streamlined Artificial Variable Free Version of Simplex Method," PLOS ONE, Public Library of Science, vol. 10(3), pages 1-28, March.
    16. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    17. Belli, Edoardo, 2022. "Smoothly adaptively centered ridge estimator," Journal of Multivariate Analysis, Elsevier, vol. 189(C).
    18. Quoc Tran-Dinh & Anastasios Kyrillidis & Volkan Cevher, 2018. "A Single-Phase, Proximal Path-Following Framework," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1326-1347, November.
    19. Kirschner, Felix, 2023. "Conic optimization with applications in finance and approximation theory," Other publications TiSEM e9bef4a5-ee46-45be-90d7-9, Tilburg University, School of Economics and Management.
    20. Alberto Marchi, 2022. "On a primal-dual Newton proximal method for convex quadratic programs," Computational Optimization and Applications, Springer, vol. 81(2), pages 369-395, March.

    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:coopap:v:83:y:2022:i:1:d:10.1007_s10589-022-00385-9. 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: 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.