| 000 | a | ||
|---|---|---|---|
| 999 |
_c33740 _d33740 |
||
| 008 | 250225b xxu||||| |||| 00| 0 eng d | ||
| 020 | _a9783031292187 | ||
| 082 |
_a519.6 _bSNI |
||
| 100 | _aSnider, Arthur David | ||
| 245 | _aBasics of optimization theory | ||
| 260 |
_bSpringer, _c2023 _aCham : |
||
| 300 |
_aviii, 143 p. ; _bill., (some col.), _c25 cm |
||
| 365 |
_b39.99 _c€ _d93.20 |
||
| 490 | _aSynthesis Lectures on Mathematics & Statistics | ||
| 504 | _aIncludes bibiographical references. | ||
| 520 | _aThis book presents a short introduction to the main tools of optimization methodology including linear programming, steepest descent, conjugate gradients, and the Karush-Kuhn-Tucker-John conditions. Each topic is developed in terms of a specific physical model, so that the strategy behind every step is motivated by a logical, concrete, easily visualized objective. A quick perusal of the Fibonacci search algorithm provides a simple and tantalizing first encounter with optimization theory, and a review of the max-min exposition of one-dimensional calculus prepares readers for the more sophisticated topics found later in the book. Notable features are the innovative perspectives on the simplex algorithm and Karush-Kuhn-Tucker-John conditions as well as a wealth of helpful diagrams. The author provides pointers to references for readers who would like to learn more about rigorous definitions, proofs, elegant reformulations and extensions, and case studies. However, the book is sufficiently self-contained to serve as a reliable resource for readers who wish to exploit commercially available optimization software without investing the time to develop expertise in its aspects. This book also: Features innovative perspectives on the simplex algorithm and Krushal-Kuhn-Tucker-John conditions Serves as a resource for readers to use the tools of optimization without needing to acquire expertise in the theory Features plentiful resources that focus on rigorous definitions, proofs, and case studies. | ||
| 650 | _aMathematical optimization | ||
| 650 | _aAugmented matrix | ||
| 650 | _aC-row | ||
| 650 | _aConvex polygon | ||
| 650 | _aFibonacci search | ||
| 650 | _aGlobal minimum; | ||
| 650 | _aLagrange multiplier | ||
| 650 | _aObjective function | ||
| 650 | _aSimplex algorithm | ||
| 650 | _aSlack variables | ||
| 650 | _aSteepest descent | ||
| 650 | _aUnimodal function | ||
| 942 |
_2ddc _cBK |
||