Introduction to Methods for Nonlinear Optimization (1st ed. 2023)

,
This book has two main objectives: •  to provide a concise introduction to nonlinear optimization methods, which can be used as a textbook at a graduate or upper undergraduate level; •  to collect and organize selected important topics on optimization algorithms, not easily found in textbooks, which can provide material for advanced courses or can serve as a reference text for self-study and research. The basic material on unconstrained and constrained optimization is organized into two blocks of chapters: •   basic theory and optimality conditions •   unconstrained and constrained algorithms. These topics are treated in short chapters that contain the most important results in theory  and algorithms, in a way that, in the authors’ experience, is suitable for introductory courses.   A third block of chapters addresses methods that are of increasing interest for solving difficult optimization problems. Difficulty can be typically due to the high nonlinearity of the objective function, ill-conditioning of the Hessian matrix, lack of information on first-order derivatives, the need to solve large-scale problems. In the book various key subjects are addressed, including: exact penalty functions and exact augmented Lagrangian functions, non monotone methods, decomposition algorithms, derivative free methods for nonlinear equations and optimization problems. The appendices at the end of the book offer a review of the essential mathematical background, including an introduction to convex analysis that can make part of an introductory course.

R1,777
List Price R2,015
Save R238 12%

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles17770
Mobicred@R167pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 9 - 15 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

This book has two main objectives: •  to provide a concise introduction to nonlinear optimization methods, which can be used as a textbook at a graduate or upper undergraduate level; •  to collect and organize selected important topics on optimization algorithms, not easily found in textbooks, which can provide material for advanced courses or can serve as a reference text for self-study and research. The basic material on unconstrained and constrained optimization is organized into two blocks of chapters: •   basic theory and optimality conditions •   unconstrained and constrained algorithms. These topics are treated in short chapters that contain the most important results in theory  and algorithms, in a way that, in the authors’ experience, is suitable for introductory courses.   A third block of chapters addresses methods that are of increasing interest for solving difficult optimization problems. Difficulty can be typically due to the high nonlinearity of the objective function, ill-conditioning of the Hessian matrix, lack of information on first-order derivatives, the need to solve large-scale problems. In the book various key subjects are addressed, including: exact penalty functions and exact augmented Lagrangian functions, non monotone methods, decomposition algorithms, derivative free methods for nonlinear equations and optimization problems. The appendices at the end of the book offer a review of the essential mathematical background, including an introduction to convex analysis that can make part of an introductory course.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer International Publishing AG

Country of origin

Switzerland

Series

La Matematica per il 3+2, 152

Release date

May 2023

Availability

Expected to ship within 9 - 15 working days

First published

2023

Authors

,

Dimensions

235 x 155mm (L x W)

Pages

723

Edition

1st ed. 2023

ISBN-13

978-3-03-126789-5

Barcode

9783031267895

Categories

LSN

3-03-126789-3



Trending On Loot