Newton-Type Methods for Optimization and Variational Problems (Springer Series in Operations Research and Financial Engineering)

Izmailov, Alexey F.; Solodov, Mikhail V.

ISBN 10: 3319353845 / ISBN 13: 9783319353845

Edité par Springer, 2016

A propos de cet article

N° de réf. du vendeur ABLIING23Mar3113020094417

Détails bibliographiques

• Titre: Newton-Type Methods for Optimization and Variational Problems (Springer Series in Operations Research and Financial Engineering)
• Éditeur: Springer
• Date de parution: 2016
• Langue: anglais
• ISBN à 10 chiffres: 3319353845
• ISBN à 13 chiffres: 9783319353845
• Reliure: Couverture souple
• État de l'article: New

A propos de ce titre

Synopsis

This book presents comprehensive state-of-the-art theoretical analysis of the fundamental Newtonian and Newtonian-related approaches to solving optimization and variational problems. A central focus is the relationship between the basic Newton scheme for a given problem and algorithms that also enjoy fast local convergence. The authors develop general perturbed Newtonian frameworks that preserve fast convergence and consider specific algorithms as particular cases within those frameworks, i.e., as perturbations of the associated basic Newton iterations. This approach yields a set of tools for the unified treatment of various algorithms, including some not of the Newton type per se. Among the new subjects addressed is the class of degenerate problems. In particular, the phenomenon of attraction of Newton iterates to critical Lagrange multipliers and its consequences as well as stabilized Newton methods for variational problems and stabilized sequential quadratic programming for optimization. This volume will be useful to researchers and graduate students in the fields of optimization and variational analysis.

Présentation de l'éditeur

This book presents state-of-the-art theoretical analysis of fundamental Newtonian and Newtonian-related approaches to solving optimization and variational problems, and offers a set of tools for the unified treatment of various algorithms.