Recent Advances in Global Optimization (eBook)

Christodoulos A. Floudas, Panos M. Pardalos (Autoren)

eBook Download: PDF

2014
644 Seiten
Princeton University Press (Verlag)
978-1-4008-6252-8 (ISBN)

Infos

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.

Produkt-Details

• Erscheint lt. Verlag: 14.7.2014
• Reihe/Serie: Princeton Legacy Library
• Reihe/Serie: Princeton Legacy Library
• Reihe/Serie: Princeton Series in Computer Science
• Reihe/Serie: Princeton Series in Computer Science
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Mathematik
• Themenwelt: Technik
• Schlagworte: Accuracy and precision • Admissible set • algorithm • algorithmic efficiency • Almost surely • analysis of algorithms • analytic function • approximation algorithm • Arbitrarily large • Basic solution (linear programming) • Bifurcation Theory • Big O notation • Calculation • central limit theorem • combinatorial optimization • complementarity theory • complex plane • Computation • computational complexity theory • Computers and Intractability • Conjugate Gradient Method • Constrained optimization • covering problems • Data classification (business intelligence) • Decision problem • Decision Theory • Determinant • Deterministic algorithm • Deterministic Global Optimization • Direction vector • Duality (optimization) • Dynamic Programming • dynamic simulation • Equation • expected value • Explicit formula • exponential function • exponential growth • Extreme point • Feasible region • Function problem • Global Optimization • Homotopy • Identity matrix • Iteration • Iterative Method • Lagrange multiplier • Linear complementarity problem • Linear Function • Linearization • Linear Programming • Lipschitz continuity • local optimum • Local search (optimization) • Loss Function • Mathematical Optimization • Maxima and minima • maximum likelihood estimation • Monte Carlo Method • Newton's method • NP-hardness • Numerical analysis • Numerical Integration • optimal control • optimal design • optimization problem • Order of accuracy • Parameter (computer programming) • Pareto Efficiency • Pointwise • polynomial • portfolio optimization • Priority queue • quadratic function • quadratic programming • Ranking (information retrieval) • Rate of Convergence • renormalization • result • Robustness (computer science) • Root-finding algorithm • scientific notation • Search Algorithm • Search problem • Sensitivity Analysis • sequential quadratic programming • Simplex Algorithm • Simultaneous Equations • Solution Set • Special case • Speedup • Stochastic Programming • Summation • Theorem • time complexity • Transcendental function • Trust region • uniform convergence • Upper and lower bounds • Variable (computer science)
• ISBN-10: 1-4008-6252-3 / 1400862523
• ISBN-13: 978-1-4008-6252-8 / 9781400862528