- ホーム
- > 洋書
- > 英文書
- > Science / Mathematics
Full Description
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.
Contents
PrefaceOn Approximation Algorithms for Concave Quadratic Programming3A New Complexity Result on Minimization of a Quadratic Function with a Sphere Constraint19Hamiltonian Cycles, Quadratic Programming, and Ranking of Extreme Points32Performance of Local Search in Minimum Concave-Cost Network Flow Problems50Solution of the Concave Linear Complementary Problem76Global Solvability of Generalized Linear Complementarity Problems and a Related Class of Polynomial Complementarity Problems102A Continuous Approach to Compute Upper Bounds in Quadratic Maximization Problems with Integer Constraints125A Class of Global Optimization Problems Solvable by Sequential Unconstrained Convex Minimization141A New Cutting Plane Algorithm for a Class of Reverse Convex 0-1 Integer Programs152Global Optimization of Problems with Polynomial Functions in One Variable165One Dimensional Global Optimization Using Linear Lower Bounds200Optimizing the Sum of Linear Fractional Functions221Minimizing and Maximizing the Product of Linear Fractional Functions259Numerical Methods for Global Optimization274Integral Global Optimization of Constrained Problems in Functional Spaces with Discontinuous Penalty Functions298Rigorous Methods for Global Optimization321Global Optimization of Composite Laminates Using Improving Hit and Run343Stochastic Minimization of Lipschitz Functions369Topographical Global Optimization384Lipschitzian Global Optimization: Some Prospective Applications399Packet Annealing: A Deterministic Method for Global Minimization, Application to Molecular Conformation433Mixed-Integer Linear Programming Reformulations for Some Nonlinear Discrete Design Optimization Problems478Mixed-Integer Nonlinear Programming on Generalized Networks513Global Minima in Root Finding543Homotopy-Continuation Algorithm for Global Optimization561Space-Covering Approach and Modified Frank-Wolfe Algorithm for Optimal Nuclear Reactor Reload Design593A Global Optimization Approach to Software Testing616
