Convergence Analysis of Gauss–Newton Methods for the Complementarity Problem

P. K. Subramanian and N. H. Xiu
Additional contact information
P. K. Subramanian: California State University at Los Angeles
N. H. Xiu: Academia Sinica

Journal of Optimization Theory and Applications, 1997, vol. 94, issue 3, No 10, 727-738

Abstract: Abstract In a recent paper (Ref. 1), the first author presented a damped Gauss–Newton algorithm to solve the complementarity problem. Although the conclusions of the convergence theorems in the paper are valid, the proofs contain minor errors. The aim of this paper is to give correct proofs and also to show that they are valid under milder conditions.

Keywords: Complementarity problems; Gauss–Newton algorithm; nonlinear systems of equations (search for similar items in EconPapers)
Date: 1997
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1022661202977 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:joptap:v:94:y:1997:i:3:d:10.1023_a:1022661202977

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1022661202977

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

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