Central Library

Normal view MARC view ISBD view

Basics of Optimization Theory [electronic resource] / by Arthur David Snider.

By: Snider, Arthur David [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Synthesis Lectures on Mathematics & Statistics: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2023Edition: 1st ed. 2023.Description: VIII, 143 p. 180 illus., 59 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783031292194.Subject(s): Mathematical optimization | Mathematics | Mathematics -- Data processing | Computer science -- Mathematics | Algorithms | Optimization | Mathematics | Applications of Mathematics | Computational Mathematics and Numerical Analysis | Mathematics of Computing | AlgorithmsAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 519.6 Online resources: Click here to access online
Contents:
A Preliminary Note -- Fibonnacci Search -- Linear Programming -- Nonlinear Programming in One Dimension -- Nonlinear Multidimensional Optimization -- Constrained Optimization.
In: Springer Nature eBookSummary: This 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.
    average rating: 0.0 (0 votes)
No physical items for this record

A Preliminary Note -- Fibonnacci Search -- Linear Programming -- Nonlinear Programming in One Dimension -- Nonlinear Multidimensional Optimization -- Constrained Optimization.

This 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.

There are no comments for this item.

Log in to your account to post a comment.