Sufficient weighted complementarity problems

Florian A. Potra ()
Additional contact information
Florian A. Potra: University of Maryland, Baltimore County

Computational Optimization and Applications, 2016, vol. 64, issue 2, No 6, 467-488

Abstract: Abstract This paper presents some fundamental results about sufficient linear weighted complementarity problems. Such a problem depends on a nonnegative weight vector. If the weight vector is zero, the problem reduces to a sufficient linear complementarity problem that has been extensively studied. The introduction of the more general notion of a weighted complementarity problem (wCP) was motivated by the fact that wCP can model more general equilibrium problems than the classical complementarity problem (CP). The introduction of a nonzero weight vector makes the theory of wCP more complicated than the theory of CP. The paper gives a characterization of sufficient linear wCP and proposes a corrector–predictor interior-point method for its numerical solution. While the proposed algorithm does not depend on the handicap $$\kappa $$ κ of the problem its computational complexity is proportional with $$1+\kappa $$ 1 + κ . If the weight vector is zero and the starting point is relatively well centered, then the computational complexity of our algorithm is the same as the best known computational complexity for solving sufficient linear CP.

Keywords: Weighted complementarity; Interior-point; Path-following; Sufficient matrix; Equilibrium problems (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-015-9811-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:64:y:2016:i:2:d:10.1007_s10589-015-9811-z

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-015-9811-z

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().