Approximations and generalized Newton methods

Approximations and generalized Newton methods We present approaches to (generalized) Newton methods in the framework of generalized equations $$0\in f(x)+M(x)$$ 0 ∈ f ( x ) + M ( x ) , where f is a function and M is a multifunction. The Newton steps are defined by approximations $${\hat{f}}$$ f ^ of f and the solutions of $$0\in {\hat{f}}(x)+M(x)$$ 0 ∈ f ^ ( x ) + M ( x ) . We give a unified view of the local convergence analysis of such methods by connecting a certain type of approximation with the desired kind of convergence and different regularity conditions for $$f+M$$ f + M . Our paper is, on the one hand, thought as a survey of crucial parts of the topic, where we mainly use concepts and results of the monograph (Klatte and Kummer in Nonsmooth equations in optimization: regularity, calculus, methods and applications, Kluwer Academic Publishers, Dordrecht, 2002). On the other hand, we present original results and new features. They concern the extension of convergence results via Newton maps (Klatte and Kummer in Nonsmooth equations in optimization: regularity, calculus, methods and applications, Kluwer Academic Publishers, Dordrecht, 2002; Kummer, in: Oettli, Pallaschke (eds) Advances in optimization, Springer, Berlin, 1992) from equations to generalized equations both for linear and nonlinear approximations $${\hat{f}}$$ f ^ , and relations between semi-smoothness, Newton maps and directional differentiability of f. We give a Kantorovich-type statement, valid for all sequences of Newton iterates under metric regularity, and recall and extend results on multivalued approximations for general inclusions $$0\in F(x)$$ 0 ∈ F ( x ) . Equations with continuous, non-Lipschitzian f are considered, too. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematical Programming Springer Journals

Approximations and generalized Newton methods

Loading next page...
 
/lp/springer_journal/approximations-and-generalized-newton-methods-VdGj9Qwnw8
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2017 by Springer-Verlag GmbH Germany and Mathematical Optimization Society
Subject
Mathematics; Calculus of Variations and Optimal Control; Optimization; Mathematics of Computing; Numerical Analysis; Combinatorics; Theoretical, Mathematical and Computational Physics; Mathematical Methods in Physics
ISSN
0025-5610
eISSN
1436-4646
D.O.I.
10.1007/s10107-017-1194-8
Publisher site
See Article on Publisher Site

Abstract

We present approaches to (generalized) Newton methods in the framework of generalized equations $$0\in f(x)+M(x)$$ 0 ∈ f ( x ) + M ( x ) , where f is a function and M is a multifunction. The Newton steps are defined by approximations $${\hat{f}}$$ f ^ of f and the solutions of $$0\in {\hat{f}}(x)+M(x)$$ 0 ∈ f ^ ( x ) + M ( x ) . We give a unified view of the local convergence analysis of such methods by connecting a certain type of approximation with the desired kind of convergence and different regularity conditions for $$f+M$$ f + M . Our paper is, on the one hand, thought as a survey of crucial parts of the topic, where we mainly use concepts and results of the monograph (Klatte and Kummer in Nonsmooth equations in optimization: regularity, calculus, methods and applications, Kluwer Academic Publishers, Dordrecht, 2002). On the other hand, we present original results and new features. They concern the extension of convergence results via Newton maps (Klatte and Kummer in Nonsmooth equations in optimization: regularity, calculus, methods and applications, Kluwer Academic Publishers, Dordrecht, 2002; Kummer, in: Oettli, Pallaschke (eds) Advances in optimization, Springer, Berlin, 1992) from equations to generalized equations both for linear and nonlinear approximations $${\hat{f}}$$ f ^ , and relations between semi-smoothness, Newton maps and directional differentiability of f. We give a Kantorovich-type statement, valid for all sequences of Newton iterates under metric regularity, and recall and extend results on multivalued approximations for general inclusions $$0\in F(x)$$ 0 ∈ F ( x ) . Equations with continuous, non-Lipschitzian f are considered, too.

Journal

Mathematical ProgrammingSpringer Journals

Published: Sep 11, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off