000 03812nam a22005775i 4500
001 978-3-031-29219-4
003 DE-He213
005 20240730164518.0
007 cr nn 008mamaa
008 230810s2023 sz | s |||| 0|eng d
020 _a9783031292194
_9978-3-031-29219-4
024 7 _a10.1007/978-3-031-29219-4
_2doi
050 4 _aQA402.5-402.6
072 7 _aPBU
_2bicssc
072 7 _aMAT042000
_2bisacsh
072 7 _aPBU
_2thema
082 0 4 _a519.6
_223
100 1 _aSnider, Arthur David.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_984929
245 1 0 _aBasics of Optimization Theory
_h[electronic resource] /
_cby Arthur David Snider.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2023.
300 _aVIII, 143 p. 180 illus., 59 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Mathematics & Statistics,
_x1938-1751
505 0 _aA Preliminary Note -- Fibonnacci Search -- Linear Programming -- Nonlinear Programming in One Dimension -- Nonlinear Multidimensional Optimization -- Constrained Optimization.
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 0 _aMathematical optimization.
_94112
650 0 _aMathematics.
_911584
650 0 _aMathematics
_xData processing.
_919904
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aAlgorithms.
_93390
650 1 4 _aOptimization.
_984932
650 2 4 _aMathematics.
_911584
650 2 4 _aApplications of Mathematics.
_931558
650 2 4 _aComputational Mathematics and Numerical Analysis.
_931598
650 2 4 _aMathematics of Computing.
_931875
650 2 4 _aAlgorithms.
_93390
710 2 _aSpringerLink (Online service)
_984934
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031292187
776 0 8 _iPrinted edition:
_z9783031292200
776 0 8 _iPrinted edition:
_z9783031292217
830 0 _aSynthesis Lectures on Mathematics & Statistics,
_x1938-1751
_984936
856 4 0 _uhttps://doi.org/10.1007/978-3-031-29219-4
912 _aZDB-2-SXSC
942 _cEBK
999 _c85745
_d85745