A homogeneous model for monotone mixed horizontal linear complementarity problems
Abstract
In this paper, 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. Finally, 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.
- Authors:
-
[1];
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Univ. of Maryland Baltimore County (UMBC), Baltimore, MD (United States)
- Publication Date:
- Research Org.:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Org.:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- OSTI Identifier:
- 1491659
- Report Number(s):
- LLNL-JRNL-737005
Journal ID: ISSN 0926-6003; 889808
- Grant/Contract Number:
- AC52-07NA27344
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Computational Optimization and Applications
- Additional Journal Information:
- Journal Volume: 72; Journal Issue: 1; Journal ID: ISSN 0926-6003
- Publisher:
- Springer
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING; Mixed horizontal LCP; Homogenization; Interior-point method
Citation Formats
Petra, Cosmin G., and Potra, Florian A. A homogeneous model for monotone mixed horizontal linear complementarity problems. United States: N. p., 2018.
Web. doi:10.1007/s10589-018-0035-x.
Petra, Cosmin G., & Potra, Florian A. A homogeneous model for monotone mixed horizontal linear complementarity problems. United States. https://doi.org/10.1007/s10589-018-0035-x
Petra, Cosmin G., and Potra, Florian A. Sat .
"A homogeneous model for monotone mixed horizontal linear complementarity problems". United States. https://doi.org/10.1007/s10589-018-0035-x. https://www.osti.gov/servlets/purl/1491659.
@article{osti_1491659,
title = {A homogeneous model for monotone mixed horizontal linear complementarity problems},
author = {Petra, Cosmin G. and Potra, Florian A.},
abstractNote = {In this paper, 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. Finally, 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.},
doi = {10.1007/s10589-018-0035-x},
journal = {Computational Optimization and Applications},
number = 1,
volume = 72,
place = {United States},
year = {Sat Sep 22 00:00:00 EDT 2018},
month = {Sat Sep 22 00:00:00 EDT 2018}
}
Free Publicly Available Full Text
Publisher's Version of Record
Other availability
Search WorldCat to find libraries that may hold this journal
Cited by: 1 work
Citation information provided by
Web of Science
Web of Science
Figures / Tables:
Table 1: Solvability and infeasibility certificates given by $τ$∗ and $κ$∗
All figures and tables
(6 total)
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
On a homogeneous algorithm for the monotone complementarity problem
journal, February 1999
- Andersen, Erling D.; Ye, Yinyu
- Mathematical Programming, Vol. 84, Issue 2
Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
journal, January 2007
- Yoshise, Akiko
- SIAM Journal on Optimization, Vol. 17, Issue 4
On the Implementation of a Primal-Dual Interior Point Method
journal, November 1992
- Mehrotra, Sanjay
- SIAM Journal on Optimization, Vol. 2, Issue 4
On homogeneous and self-dual algorithms for LCP
journal, January 1997
- Ye, Yinyu
- Mathematical Programming, Vol. 76, Issue 1
A new polynomial-time algorithm for linear programming
journal, December 1984
- Karmarkar, N.
- Combinatorica, Vol. 4, Issue 4
On interior algorithms for linear programming with no regularity assumptions
journal, May 1992
- Anstreicher, Kurt M.
- Operations Research Letters, Vol. 11, Issue 4
Generalized Linear Complementarity Problems
journal, May 1995
- Güler, Osman
- Mathematics of Operations Research, Vol. 20, Issue 2
Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
journal, February 1996
- Bonnans, J. Frédéric; Gonzaga, Clovis C.
- Mathematics of Operations Research, Vol. 21, Issue 1
Properties of an Interior-Point Mapping for Mixed Complementarity Problems
journal, August 1996
- Monteiro, R. D. C.; Pang, Jong-Shi
- Mathematics of Operations Research, Vol. 21, Issue 3
Equivaence between different formulations of the linear complementarity promblem
journal, January 1997
- anitescu, Mihai; Lesaja, Goran; Potra, Florian A.
- Optimization Methods and Software, Vol. 7, Issue 3-4
Object-oriented software for quadratic programming
journal, March 2003
- Gertz, E. Michael; Wright, Stephen J.
- ACM Transactions on Mathematical Software, Vol. 29, Issue 1
HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method
journal, August 1995
- Gondzio, Jacek
- European Journal of Operational Research, Vol. 85, Issue 1
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
journal, February 1994
- Ye, Yinyu; Todd, Michael J.; Mizuno, Shinji
- Mathematics of Operations Research, Vol. 19, Issue 1
Generalizations of P0- and P-properties; extended vertical and horizontal linear complementarity problems
journal, July 1995
- Sznajder, Roman; Gowda, M. Seetharama
- Linear Algebra and its Applications, Vol. 223-224
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
journal, January 2017
- Huang, Kuo-Ling; Mehrotra, Sanjay
- INFORMS Journal on Computing, Vol. 29, Issue 1
On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
journal, August 1992
- Lustig, Irvin J.; Marsten, Roy E.; Shanno, David F.
- SIAM Journal on Optimization, Vol. 2, Issue 3
A Mehrotra-type predictor-corrector algorithm with polynomiality andQ-subquadratic convergence
journal, December 1996
- Zhang, Detong; Zhang, Yin
- Annals of Operations Research, Vol. 62, Issue 1
Reducing a monotone horizontal LCP to an LCP
journal, January 1995
- Gowda, M. S.
- Applied Mathematics Letters, Vol. 8, Issue 1
On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
journal, February 1998
- Monteiro, R. D. C.; Pang, Jong-Shi
- Mathematics of Operations Research, Vol. 23, Issue 1
A new polynomial-time algorithm for linear programming
conference, January 1984
- Karmarkar, N.
- Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84
A New Polynomial-time Algorithm for Linear Programming
text, January 2019
- Mehendale, Dhananjay P.
- Unpublished
Figures / Tables found in this record:
Figures/Tables have been extracted from DOE-funded journal article accepted manuscripts.