IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v157y2013i2d10.1007_s10957-012-0195-2.html
   My bibliography  Save this article

A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems

Author

Listed:
  • H. Mansouri

    (Shahrekord University)

  • M. Pirhaji

    (Shahrekord University)

Abstract

In this paper, we propose an interior-point algorithm for monotone linear complementarity problems. The algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only full-Newton steps. Moreover, it is proven that the number of iterations of the algorithm coincides with the well-known best iteration bound for monotone linear complementarity problems.

Suggested Citation

  • H. Mansouri & M. Pirhaji, 2013. "A Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 157(2), pages 451-461, May.
    • Handle: RePEc:spr:joptap:v:157:y:2013:i:2:d:10.1007_s10957-012-0195-2
    DOI: 10.1007/s10957-012-0195-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0195-2
    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-012-0195-2?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. Filiz Gurtuna & Cosmin Petra & Florian Potra & Olena Shevchenko & Adrian Vancea, 2011. "Corrector-predictor methods for sufficient linear complementarity problems," Computational Optimization and Applications, Springer, vol. 48(3), pages 453-485, April.
    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. Behrouz Kheirfam, 2014. "A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 853-869, June.
    2. 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.

    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. Behrouz Kheirfam, 2015. "A Corrector–Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 246-260, January.
    2. Florian A. Potra, 2016. "Sufficient weighted complementarity problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 467-488, June.
    3. G. Wang & C. Yu & K. Teo, 2014. "A full-Newton step feasible interior-point algorithm for $$P_*(\kappa )$$ P ∗ ( κ ) -linear complementarity problems," Journal of Global Optimization, Springer, vol. 59(1), pages 81-99, May.
    4. Soodabeh Asadi & Zsolt Darvay & Goran Lesaja & Nezam Mahdavi-Amiri & Florian Potra, 2020. "A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 864-878, September.
    5. Behrouz Kheirfam, 2014. "A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 853-869, June.

    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:157:y:2013:i:2:d:10.1007_s10957-012-0195-2. 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.