Newton Type Methods For Optimization And Variational Problems

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.

Semismooth Newton methods are a modern class of remarkably powerful and versatile algorithms for solving constrained optimization problems with partial differential equations (PDEs), variational inequalities, and related problems. This book provides a comprehensive presentation of these methods in function spaces, striking a balance between thoroughly developed theory and numerical applications. Although largely self-contained, the book also covers recent developments in the field, such as state-constrained problems, and offers new material on topics such as improved mesh independence results. The theory and methods are applied to a range of practically important problems, including: optimal control of nonlinear elliptic differential equations, obstacle problems, and flow control of instationary Navier-Stokes fluids. In addition, the author covers adjoint-based derivative computation and the efficient solution of Newton systems by multigrid and preconditioned iterative methods.

Lagrange multiplier theory provides a tool for the analysis of a general class of nonlinear variational problems and is the basis for developing efficient and powerful iterative methods for solving these problems. This comprehensive monograph analyzes Lagrange multiplier theory and shows its impact on the development of numerical algorithms for problems posed in a function space setting. The authors develop and analyze efficient algorithms for constrained optimization and convex optimization problems based on the augumented Lagrangian concept and cover such topics as sensitivity analysis, convex optimization, second order methods, and shape sensitivity calculus. General theory is applied to challenging problems in optimal control of partial differential equations, image analysis, mechanical contact and friction problems, and American options for the Black-Scholes model.

Shape optimization problems are treated from the classical and modern perspectives Targets a broad audience of graduate students in pure and applied mathematics, as well as engineers requiring a solid mathematical basis for the solution of practical problems Requires only a standard knowledge in the calculus of variations, differential equations, and functional analysis Driven by several good examples and illustrations Poses some open questions.

This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis rather than generality, and while it provides pointers to the literature for the most general theoretical results and robust software, the author thinks it is more important that readers have a complete understanding of special cases that convey essential ideas. A companion to Kelley's book, Iterative Methods for Linear and Nonlinear Equations (SIAM, 1995), this book contains many exercises and examples and can be used as a text, a tutorial for self-study, or a reference. Iterative Methods for Optimization does more than cover traditional gradient-based optimization: it is the first book to treat sampling methods, including the Hooke-Jeeves, implicit filtering, MDS, and Nelder-Mead schemes in a unified way, and also the first book to make connections between sampling methods and the traditional gradient-methods. Each of the main algorithms in the text is described in pseudocode, and a collection of MATLAB codes is available. Thus, readers can experiment with the algorithms in an easy way as well as implement them in other languages.

After more than three decades of research, the subject of complementarity problems and its numerous extensions has become a well-established and fruitful discipline within mathematical programming and applied mathematics. Sources of these problems are diverse and span numerous areas in engineering, economics, and the sciences. Includes refereed articles.

This monograph is devoted to a comprehensive treatment of iterative methods for solving nonlinear equations with particular emphasis on semi-local convergence analysis. Theoretical results are applied to engineering, dynamic economic systems, input-output systems, nonlinear and linear differential equations, and optimization problems. Accompanied by many exercises, some with solutions, the book may be used as a supplementary text in the classroom for an advanced course on numerical functional analysis.