Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Bütikofer, Stephan | - |
| dc.date.accessioned | 2018-12-14T15:39:50Z | - |
| dc.date.available | 2018-12-14T15:39:50Z | - |
| dc.date.issued | 2008 | - |
| dc.identifier.issn | 1432-2994 | de_CH |
| dc.identifier.issn | 1432-5217 | de_CH |
| dc.identifier.uri | https://digitalcollection.zhaw.ch/handle/11475/13867 | - |
| dc.description.abstract | We give a framework for the globalization of a nonsmooth Newton method. In part one we start with recalling B. Kummer’s approach to convergence analysis of a nonsmooth Newton method and state his results for local convergence. In part two we give a globalized version of this method. Our approach uses a path search idea to control the descent. After elaborating the single steps, we analyze and prove the global convergence resp. the local superlinear or quadratic convergence of the algorithm. In the third part we illustrate the method for nonlinear complementarity problems. | de_CH |
| dc.language.iso | en | de_CH |
| dc.publisher | Springer | de_CH |
| dc.relation.ispartof | Mathematical Methods of Operations Research | de_CH |
| dc.rights | Licence according to publishing contract | de_CH |
| dc.subject.ddc | 510: Mathematik | de_CH |
| dc.title | Globalizing a nonsmooth Newton method via nonmonotone path search | de_CH |
| dc.type | Beitrag in wissenschaftlicher Zeitschrift | de_CH |
| dcterms.type | Text | de_CH |
| zhaw.departement | School of Engineering | de_CH |
| zhaw.organisationalunit | Institut für Datenanalyse und Prozessdesign (IDP) | de_CH |
| dc.identifier.doi | 10.1007/s00186-008-0219-8 | de_CH |
| zhaw.funding.eu | No | de_CH |
| zhaw.issue | 2 | de_CH |
| zhaw.originated.zhaw | No | de_CH |
| zhaw.pages.end | 256 | de_CH |
| zhaw.pages.start | 235 | de_CH |
| zhaw.publication.status | publishedVersion | de_CH |
| zhaw.volume | 68 | de_CH |
| zhaw.publication.review | Peer review (Publikation) | de_CH |
| Appears in collections: | Publikationen School of Engineering | |
Files in This Item:
There are no files associated with this item.
Show simple item record
Bütikofer, S. (2008). Globalizing a nonsmooth Newton method via nonmonotone path search. Mathematical Methods of Operations Research, 68(2), 235–256. https://doi.org/10.1007/s00186-008-0219-8
Bütikofer, S. (2008) ‘Globalizing a nonsmooth Newton method via nonmonotone path search’, Mathematical Methods of Operations Research, 68(2), pp. 235–256. Available at: https://doi.org/10.1007/s00186-008-0219-8.
S. Bütikofer, “Globalizing a nonsmooth Newton method via nonmonotone path search,” Mathematical Methods of Operations Research, vol. 68, no. 2, pp. 235–256, 2008, doi: 10.1007/s00186-008-0219-8.
BÜTIKOFER, Stephan, 2008. Globalizing a nonsmooth Newton method via nonmonotone path search. Mathematical Methods of Operations Research. 2008. Bd. 68, Nr. 2, S. 235–256. DOI 10.1007/s00186-008-0219-8
Bütikofer, Stephan. 2008. “Globalizing a Nonsmooth Newton Method via Nonmonotone Path Search.” Mathematical Methods of Operations Research 68 (2): 235–56. https://doi.org/10.1007/s00186-008-0219-8.
Bütikofer, Stephan. “Globalizing a Nonsmooth Newton Method via Nonmonotone Path Search.” Mathematical Methods of Operations Research, vol. 68, no. 2, 2008, pp. 235–56, https://doi.org/10.1007/s00186-008-0219-8.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.