Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms

Zheng-Hai Huang ()

Mathematical Methods of Operations Research, 2005, vol. 61, issue 1, 55 pages

Abstract: In this paper we propose a non-interior-point smoothing algorithm for solving the monotone nonlinear complementarity problem (NCP). The proposed algorithm is simpler than many existing non-interior-point smoothing algorithms in the sense that it only needs to solve one system of linear equations and to perform one line search at each iteration. We show that the proposed algorithm is globally convergent under the assumption that the NCP concerned has a nonempty solution set. Such assumption is weaker than those required by most other non-interior-point smoothing algorithms. In particular, we prove that the solution obtained by the proposed algorithm is a maximally complementary solution of the NCP concerned. Preliminary numerical results are reported. Copyright Springer-Verlag 2005

Keywords: Nonlinear complementarity problem; Non-interior-point smoothing algorithm; Global convergence; Maximally complementary solution; 90C33; 65K10 (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860400384 (text/html)
Access to full text is restricted to subscribers.

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:mathme:v:61:y:2005:i:1:p:41-55

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

DOI: 10.1007/s001860400384

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().