Handbook of Test Problems in Local and Global Optimization

1. Auflage. Softcover version of original hardcover Auflage 1999
ISBN: 978-1-4419-4812-0
Verlag: Springer US

Buch, Englisch, 442 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 692 g

Reihe: Nonconvex Optimization and Its Applications

Significant research activities have taken place in the areas of local and global optimization in the last two decades. Many new theoretical, computational, algorithmic, and software contributions have resulted. It has been realized that despite these numerous contributions, there does not exist a systematic forum for thorough experimental computational testing and· evaluation of the proposed optimization algorithms and their implementations. Well-designed nonconvex optimization test problems are of major impor tance for academic and industrial researchers interested in algorithmic and software development. It is remarkable that eventhough nonconvex models dominate all the important application areas in engineering and applied sci ences, there is only a limited dass of reported representative test problems. This book reflects our long term efforts in designing a benchmark database and it is motivated primarily from the need for nonconvex optimization test problems. The present collection of benchmarks indudes test problems from literature studies and a large dass of applications that arise in several branches of engineering and applied science.

Zielgruppe

Research

Autoren/Hrsg.

Floudas, Christodoulos A.

Pardalos, Panos M.

Adjiman, Claire

Esposito, William R.

Schweiger, Carl A.

Gümüs, Zeynep H.

Harding, Stephen T.

Klepeis, John L.

Meyer, Clifford A.

Fachgebiete

• Mathematik | Informatik Mathematik Operations Research
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle

Inhaltsverzeichnis

1 Introduction.- 2 Quadratic Programming Problems.- 3 Quadratically Constrained Problems.- 4 Univariate Polynomial Problems.- 5 Bilinear problems.- 6 Biconvex and (D.C.) Problems.- 7 Generalized Geometric Programming.- 8 Twice Continuously Differentiable NLPs.- 9 Bilevel Programming Problems.- 10 Complementarity Problems.- 11 Semidefinite Programming Problems.- 12 Mixed-Integer Nonlinear Problems.- 13 Combinatorial Optimization Problems.- 14 Nonlinear Systems of Equations.- 15 Dynamic Optimization Problems.