On a semismooth least squares formulation of complementarity problems with gap reduction
We present a nonsmooth least squares reformulation of the complementarity problem and investigate its convergence properties. The global and local fast convergence results (under mild assumptions) are similar to some existing equation-based methods. In fact, our least squares formulation is obtained...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Dokumenttyp: | Article (Journal) |
| Sprache: | Englisch |
| Veröffentlicht: |
04 Feb 2008
|
| In: |
Optimization methods & software
Year: 2004, Jahrgang: 19, Heft: 5, Pages: 507-525 |
| ISSN: | 1029-4937 |
| DOI: | 10.1080/10556780410001683096 |
| Online-Zugang: | Resolving-System, Volltext: http://dx.doi.org/10.1080/10556780410001683096
|
| Verfasserangaben: | Christian Kanzow, Stefania Petra |
| Zusammenfassung: | We present a nonsmooth least squares reformulation of the complementarity problem and investigate its convergence properties. The global and local fast convergence results (under mild assumptions) are similar to some existing equation-based methods. In fact, our least squares formulation is obtained by modifying one of these equation-based methods (using the Fischer-Burmeister function) in such a way that we overcome a major drawback of this equation-based method. The resulting nonsmooth Levenberg-Marquardt-type method turns out to be significantly more robust than the corresponding equation-based method. This is illustrated by our numerical results using the MCPLIB test problem collection. |
|---|---|
| Beschreibung: | Published online: 04 Feb 2008 Gesehen am 26.07.2018 |
| Beschreibung: | Online Resource |
| ISSN: | 1029-4937 |
| DOI: | 10.1080/10556780410001683096 |