Cantitate/Preț
Produs

Basics of Optimization Theory: Synthesis Lectures on Mathematics & Statistics

Autor Arthur David Snider
en Limba Engleză Hardback – 11 aug 2023
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
Citește tot Restrânge

Din seria Synthesis Lectures on Mathematics & Statistics

Preț: 28812 lei

Nou

Puncte Express: 432

Preț estimativ în valută:
5514 5728$ 4580£

Carte tipărită la comandă

Livrare economică 29 ianuarie-04 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031292187
ISBN-10: 3031292189
Pagini: 143
Ilustrații: VIII, 143 p. 180 illus., 59 illus. in color.
Dimensiuni: 168 x 240 mm
Greutate: 0.41 kg
Ediția:1st ed. 2023
Editura: Springer International Publishing
Colecția Springer
Seria Synthesis Lectures on Mathematics & Statistics

Locul publicării:Cham, Switzerland

Cuprins

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

Notă biografică

Arthur David Snider, PhD., is a Professor Emeritus in the Departments of Mathematics, Physics, and Electrical Engineering at the University of South Florida. He has 50+ years of experience in modeling physical systems in the areas of heat transfer, electromagnetics, microwave circuits, and orbital mechanics, as well as the mathematical areas of numerical analysis, signal processing, differential equations, and optimization.

Textul de pe ultima copertă

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

Caracteristici

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