Nonlinear optimization with engineering applications (Q924872): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-0-387-78723-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W629937909 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:06, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonlinear optimization with engineering applications |
scientific article |
Statements
Nonlinear optimization with engineering applications (English)
0 references
29 May 2008
0 references
This book gives on 280 pages a broad overview of nonlinear optimization. The presented methods include direct search techniques, the steepest descend approach, trust region methods as well as Newton and quasi-Newton techniques with globalization strategies for the unconstrained case. For constrained optimization problems penalty approaches, SQP methods, barrier techniques and interior point methods are discussed. Additionally, the book covers several topics as line search approaches, filter methods and the computation of derivatives. The presented optimization approaches are compared with each other by means of several examples with up to 200 variables. The numerical results are mostly obtained by the software package OPTIMA written by the author. The book contains 25 chapters with an average of 11 pages. Due to the variety of considered solution techniques, the presentation of each method and its theoretical analysis is rather brief. Nevertheless, the introduction of the different techniques is written in a very comprehensible way. Furthermore, each section contains exercises to verify and deepen the understanding of the material.
0 references
nonlinear programming
0 references
unconstrained optimization
0 references
constrained optimization
0 references