Basics of optimization theory (Record no. 33740)

000 -LEADER
fixed length control field a
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 250225b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783031292187
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519.6
Item number SNI
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Snider, Arthur David
245 ## - TITLE STATEMENT
Title Basics of optimization theory
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2023
Place of publication, distribution, etc Cham :
300 ## - PHYSICAL DESCRIPTION
Extent viii, 143 p. ;
Other physical details ill., (some col.),
Dimensions 25 cm
365 ## - TRADE PRICE
Price amount 39.99
Price type code
Unit of pricing 93.20
490 ## - SERIES STATEMENT
Series statement Synthesis Lectures on Mathematics & Statistics
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibiographical references.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematical optimization
Topical term or geographic name as entry element Augmented matrix
Topical term or geographic name as entry element C-row
Topical term or geographic name as entry element Convex polygon
Topical term or geographic name as entry element Fibonacci search
Topical term or geographic name as entry element Global minimum;
Topical term or geographic name as entry element Lagrange multiplier
Topical term or geographic name as entry element Objective function
Topical term or geographic name as entry element Simplex algorithm
Topical term or geographic name as entry element Slack variables
Topical term or geographic name as entry element Steepest descent
Topical term or geographic name as entry element Unimodal function
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Source of acquisition Cost, normal purchase price Full call number Barcode Date last seen Koha item type
          DAU DAU 2025-02-19 KBD 3727.07 519.6 SNI 035189 2025-02-25 Books

Powered by Koha