Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Derivative-Free Direct-Type Global Optimization: Applications and Software

Derivative-Free Direct-Type Global Optimization: Applications and Software

Stripinis, Linas
Paulavičius, Remigijus

Paperback

Series: Springerbriefs in Optimization

ApplicationsGeneral MathematicsProgramming

ISBN10: 3031465393
ISBN13: 9783031465390
Publisher: Springer Nature
Published: Nov 28 2023
Pages: 122
Weight: 0.44
Height: 0.29 Width: 6.14 Depth: 9.21
Language: English

After providing an in-depth introduction to derivative-free global optimization with various constraints, this book presents new original results from well-known experts on the subject. A primary focus of this book is the well-known class of deterministic DIRECT (DIviding RECTangle)-type algorithms. This book describes a new set of algorithms derived from newly developed partitioning, sampling, and selection approaches in the box- and generally-constrained global optimization, including extensions to multi-objective optimization. DIRECT-type optimization algorithms are discussed in terms of fundamental principles, potential, and boundaries of their applicability. The algorithms are analyzed from various perspectives to offer insight into their main features. This explains how and why they are effective at solving optimization problems. As part of this book, the authors also present several techniques for accelerating the DIRECT-type algorithms through parallelization and implementing efficient data structures by revealing the pros and cons of the design challenges involved. A collection of DIRECT-type algorithms described and analyzed in this book is available in DIRECTGO, a MATLAB toolbox on GitHub. Lastly, the authors demonstrate the performance of the algorithms for solving a wide range of global optimization problems with various constraints ranging from a few to hundreds of variables.

1 different editions

Also available

Also from

Stripinis, Linas

View All

Also in

General Mathematics

View All