Alefeld, Götz ;
Wang, Zhengyu
Verification of Solutions for Almost Linear Complementarity Problems
Abstract
We present a computational enclosure method for the solution of a class of nonlinear complementarity problems.
The procedure also delivers a proof for the uniqueness of the solution.
BibTeX - Entry
@InProceedings{alefeld_et_al:DagSemProc.05391.9,
author = {Alefeld, G\"{o}tz and Wang, Zhengyu},
title = {{Verification of Solutions for Almost Linear Complementarity Problems}},
booktitle = {Algebraic and Numerical Algorithms and Computer-assisted Proofs},
pages = {1--21},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {5391},
editor = {Bruno Buchberger and Shin'ichi Oishi and Michael Plum and Sigfried M. Rump},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/443},
URN = {urn:nbn:de:0030-drops-4431},
doi = {10.4230/DagSemProc.05391.9},
annote = {Keywords: Complementarity problems, verification of solutions}
}
|
Keywords: |
|
Complementarity problems, verification of solutions |
|
Seminar: |
|
05391 - Algebraic and Numerical Algorithms and Computer-assisted Proofs
|
|
Issue date: |
|
2006 |
|
Date of publication: |
|
31.01.2006 |
31.01.2006
