IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v72y2019i1d10.1007_s10589-018-0035-x.html
   My bibliography  Save this article

A homogeneous model for monotone mixed horizontal linear complementarity problems

Author

Listed:
  • Cosmin G. Petra

    (Lawrence Livermore National Laboratory)

  • Florian A. Potra

    (University of Maryland, Baltimore County)

Abstract

We propose a homogeneous model for the class of mixed horizontal linear complementarity problems. The proposed homogeneous model is always solvable and provides the solution of the original problem if it exists, or a certificate of infeasibility otherwise. Our formulation preserves the sparsity of the original formulation and does not reduce to the homogeneous model of the equivalent standard linear complementarity problem. We study the properties of the model and show that interior-point methods can be used efficiently for the numerical solutions of the homogeneous problem. Numerical experiments show convincingly that it is more efficient to use the proposed homogeneous model for the mixed horizontal linear complementarity problem than to use known homogeneous models for the equivalent standard linear complementarity problem.

Suggested Citation

  • Cosmin G. Petra & Florian A. Potra, 2019. "A homogeneous model for monotone mixed horizontal linear complementarity problems," Computational Optimization and Applications, Springer, vol. 72(1), pages 241-267, January.
    • Handle: RePEc:spr:coopap:v:72:y:2019:i:1:d:10.1007_s10589-018-0035-x
    DOI: 10.1007/s10589-018-0035-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-018-0035-x
    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-018-0035-x?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. Kuo-Ling Huang & Sanjay Mehrotra, 2017. "Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 36-53, February.
    2. Gondzio, Jacek, 1995. "HOPDM (version 2.12) -- A fast LP solver based on a primal-dual interior point method," European Journal of Operational Research, Elsevier, vol. 85(1), pages 221-225, August.
    3. R. D. C. Monteiro & Jong-Shi Pang, 1996. "Properties of an Interior-Point Mapping for Mixed Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 21(3), pages 629-654, August.
    4. R. D. C. Monteiro & Jong-Shi Pang, 1998. "On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 23(1), pages 39-60, February.
    5. J. Frédéric Bonnans & Clovis C. Gonzaga, 1996. "Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 21(1), pages 1-25, February.
    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. Cosmin Petra & Mihai Anitescu, 2012. "A preconditioning technique for Schur complement systems arising in stochastic optimization," Computational Optimization and Applications, Springer, vol. 52(2), pages 315-344, June.
    2. Renato D. C. Monteiro & Paulo R. Zanjácomo, 2000. "General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 381-399, August.
    3. Stojkovic, Nebojsa V. & Stanimirovic, Predrag S., 2001. "Two direct methods in linear programming," European Journal of Operational Research, Elsevier, vol. 131(2), pages 417-439, June.
    4. Peter Kall & János Mayer, 2006. "Some insights into the solution algorithms for SLP problems," Annals of Operations Research, Springer, vol. 142(1), pages 147-164, February.
    5. Sturm, Jos F. & Zhang, Shuzhong, 2000. "On weighted centers for semidefinite programming," European Journal of Operational Research, Elsevier, vol. 126(2), pages 391-407, October.
    6. Jacek Gondzio & Roy Kouwenberg, 2001. "High-Performance Computing for Asset-Liability Management," Operations Research, INFORMS, vol. 49(6), pages 879-891, December.
    7. Kypreos, Socrates, 2005. "Modeling experience curves in MERGE (model for evaluating regional and global effects)," Energy, Elsevier, vol. 30(14), pages 2721-2737.
    8. Yuriy Stoyan & Georgiy Yaskov, 2012. "Packing congruent hyperspheres into a hypersphere," Journal of Global Optimization, Springer, vol. 52(4), pages 855-868, April.
    9. Yun-Bin Zhao & Duan Li, 2001. "On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 119-146, February.
    10. Stanimirovic, Predrag S. & Stojkovic, Nebojsa V. & Kovacevic-Vujcic, Vera V., 2005. "Stabilization of Mehrotra's primal-dual algorithm and its implementation," European Journal of Operational Research, Elsevier, vol. 165(3), pages 598-609, September.
    11. G. Al-Jeiroudi & J. Gondzio, 2009. "Convergence Analysis of the Inexact Infeasible Interior-Point Method for Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 141(2), pages 231-247, May.
    12. Kouwenberg, Roy, 2001. "Scenario generation and stochastic programming models for asset liability management," European Journal of Operational Research, Elsevier, vol. 134(2), pages 279-292, October.
    13. M. A. Goberna & T. Terlaky & M. I. Todorov, 2010. "Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 14-26, February.
    14. J. Gondzio & F. N. C. Sobral, 2019. "Quasi-Newton approaches to interior point methods for quadratic problems," Computational Optimization and Applications, Springer, vol. 74(1), pages 93-120, September.
    15. C. Pola & C. A. Sagastizábal, 2000. "Infeasible Predictor-Corrector Interior-Point Method Applied to Image Restoration in the Presence of Noise," Journal of Optimization Theory and Applications, Springer, vol. 104(3), pages 517-538, March.
    16. Halicka, Margareta, 2002. "Analyticity of the central path at the boundary point in semidefinite programming," European Journal of Operational Research, Elsevier, vol. 143(2), pages 311-324, December.
    17. Gondzio, Jacek & Kouwenberg, Roy & Vorst, Ton, 2003. "Hedging options under transaction costs and stochastic volatility," Journal of Economic Dynamics and Control, Elsevier, vol. 27(6), pages 1045-1068, April.
    18. Tsionas, Mike G., 2020. "A coherent approach to Bayesian Data Envelopment Analysis," European Journal of Operational Research, Elsevier, vol. 281(2), pages 439-448.
    19. María Gonzalez-Lima & Aurelio Oliveira & Danilo Oliveira, 2013. "A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming," Computational Optimization and Applications, Springer, vol. 56(3), pages 573-597, December.
    20. R. Andreani & A. Friedlander & J. M. Martínez, 1997. "Solution of Finite-Dimensional Variational Inequalities Using Smooth Optimization with Simple Bounds," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 635-657, 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:coopap:v:72:y:2019:i:1:d:10.1007_s10589-018-0035-x. 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.