Publication type: Conference other
Type of review: Peer review (abstract)
Title: Globalizing a nonsmooth Newton method via path search
Authors: Bütikofer, Stephan
et. al: No
Conference details: 13th Czech-French-German Conference on Optimization (CFG), Heidelberg, 17-21 September 2007
Issue Date: 18-Sep-2007
Language: English
Subjects: Nonsmooth Newton method; Global convergence; Path search
Subject (DDC): 
Abstract: We give a framework for the globalization of a nonsmooth Newton method introduced by B. Kummer. We start with recalling Kummer's approach to convergence analysis of this method and state his results for local convergence. In a second part we give a globalized version of this method. In our approach we use a path-search idea to control the descent. After elaborating the single steps, we analyze and discuss the proof of global convergence resp. of local superlinear or quadratic convergence of the algorithm. We end with illustrating our ideas at some interesting examples.
Fulltext version: Published version
License (according to publishing contract): Licence according to publishing contract
Departement: School of Engineering
Organisational Unit: Institute of Data Analysis and Process Design (IDP)
Appears in Collections:Publikationen School of Engineering

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.