โ Scribed by Christodoulos A. Floudas; Panos M. Pardalos
No coin nor oath required. For personal study only.
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
PREFACE
On approximation algorithms for concave quadratic programming
A New Complexity Result on Minimization of a Quadratic Function with a Sphere Constraint
Hamiltonian Cycles, Quadratic Programming, and Ranking of Extreme Points
Performance of Local Search In Minimum Concave-Cost Network Flow Problems
SOLUTION OF THE CONCAVE LINEAR COMPLEMENTARITY PROBLEM
Global Solvability of Generalized Linear Complementarity Problems and a Related Class of Polynomial Complementarity Problems
A Continuous Approach to Compute Upper Bounds in Quadratic Maximization Problems With Integer Constraints
A Class of Global Optimization Problems Solvable by Sequential Unconstrained Convex Minimization
A New Cutting Plane Algorithm for a Class of Reverse Convex 0-1 Integer Programs
Global Optimization of Problems with Polynomial Functions in One Variable
One Dimensional Global Optimization Using Linear Lower Bounds
Optimizing the Sum of Linear Fractional Functions
Minimizing and Maximizing the Product of Linear Fractional Functions
Numerical Methods for Global Optimization
Integral Global Optimization of Constrained Problems in Functional Spaces with Discontinuous Penalty Functions
Rigorous Methods for Global Optimization
Global Optimization of Composite Laminates Using Improving Hit and Run
Stochastic Minimization of Lipschitz Functions
Topographical Global Optimization
Lipschitzian Global Optimization: Some Prospective Applications
Packet Annealing: A Deterministic Method for Global Minimization. Application to Molecular Conformation
Mixed-Integer Linear Programming Reformulations for Some Nonlinear Discrete Design Optimization Problems
Mixed-Integer Nonlinear Programming on Generalized Networks
Global Minima in Root Finding
HOMOTOPY-CONTINUATION ALGORITHM FOR GLOBAL OPTIMIZATION
SPACE-COVERING APPROACH AND MODIFIED FRANK-WOLFE ALGORITHM FOR OPTIMAL NUCLEAR REACTOR RELOAD DESIGN
A GLOBAL OPTIMIZATION APPROACH TO SOFTWARE TESTING
๐ SIMILAR VOLUMES
The contributions appearing in this book give an overview of recent research done in optimization and related areas, such as optimal control, calculus of variations, and game theory. They do not only address abstract issues of optimization theory, but are also concerned with the modeling and compute
In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network optimi
<p><p>Optimization is part of our everyday life. We try to organize our work in a better way and optimization occurs in minimizing time and cost or the maximization of the profit, quality and efficiency.</p><p>Also many real world problems arising in engineering, economics, medicine and other domain