img Leseprobe Leseprobe

Recent Advances in Global Optimization

Christodoulos A. Floudas, Panos M. Pardalos

PDF
ca. 139,99
Amazon iTunes Thalia.de Weltbild.de Hugendubel Bücher.de ebook.de kobo Osiander Google Books Barnes&Noble bol.com Legimi yourbook.shop Kulturkaufhaus ebooks-center.de
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Princeton University Press img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Mathematik

Beschreibung

This book will present the papers delivered at the first U.S. conference devoted exclusively to global optimization and will thus provide valuable insights into the significant research on the topic that has been emerging during recent years. Held at Princeton University in May 1991, the conference brought together an interdisciplinary group of the most active developers of algorithms for global optimization in order to focus the attention of the mathematical programming community on the unsolved problems and diverse applications of this field. The main subjects addressed at the conference were advances in deterministic and stochastic methods for global optimization, parallel algorithms for global optimization problems, and applications of global optimization. Although global optimization is primarily a mathematical problem, it is relevant to several other disciplines, including computer science, applied mathematics, physical chemistry, molecular biology, statistics, physics, engineering, operations research, communication theory, and economics. Global optimization problems originate from a wide variety of mathematical models of real-world systems. Some of its applications are allocation and location problems and VLSI and data-base design problems.

Originally published in 1991.

The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

Weitere Titel von diesem Autor
Weitere Titel in dieser Kategorie
Cover Quantum Leaps
Hugh Barker
Cover Translation Surfaces
Jayadev S Athreya

Kundenbewertungen

Schlagwörter

Upper and lower bounds, Exponential function, Lipschitz continuity, Ranking (information retrieval), Variable (computer science), Search algorithm, Summation, Covering problems, Lagrange multiplier, Optimal design, Computation, Local optimum, Time complexity, Homotopy, Iteration, Search problem, Linear complementarity problem, Approximation algorithm, Extreme point, Rate of convergence, Linear programming, Optimal control, Simplex algorithm, Conjugate gradient method, Maxima and minima, NP-hardness, Root-finding algorithm, Dynamic programming, Local search (optimization), Central limit theorem, Constrained optimization, Special case, Result, Robustness (computer science), Priority queue, Complex plane, Global optimization, Newton's method, Algorithmic efficiency, Direction vector, Linearization, Big O notation, Trust region, Order of accuracy, Speedup, Deterministic global optimization, Polynomial, Stochastic programming, Algorithm, Loss function, Function problem, Decision problem, Computational complexity theory, Pareto efficiency, Iterative method, Calculation, Exponential growth, Quadratic function, Accuracy and precision, Mathematical optimization, Equation, Maximum likelihood estimation, Bifurcation theory, Portfolio optimization, Quadratic programming, Feasible region, Duality (optimization), Optimization problem, Theorem, Combinatorial optimization