The DIRECT algorithm: 25 years Later

DR Jones, JRRA Martins - Journal of global optimization, 2021 - Springer
Introduced in 1993, the DIRECT global optimization algorithm provided a fresh approach to
minimizing a black-box function subject to lower and upper bounds on the variables. In …

[KİTAP][B] Aggregation functions: A guide for practitioners

G Beliakov, A Pradera, T Calvo - 2007 - Springer
The target audience of this book are computer scientists, system architects, knowledge
engineers and programmers, who face a problem of combining various inputs into a single …

[KİTAP][B] Introduction to global optimization

R Horst, PM Pardalos, N Van Thoai - 2000 - books.google.com
In this edition, the scope and character of the monograph did not change with respect to the
first edition. Taking into account the rapid development of the field, we have, however …

[KİTAP][B] Global optimization in action: continuous and Lipschitz optimization: algorithms, implementations and applications

JD Pintér - 1995 - books.google.com
In science, engineering and economics, decision problems are frequently modelled by
optimizing the value of a (primary) objective function under stated feasibility constraints. In …

Certifying geometric robustness of neural networks

M Balunovic, M Baader, G Singh… - Advances in Neural …, 2019 - proceedings.neurips.cc
The use of neural networks in safety-critical computer vision systems calls for their
robustness certification against natural geometric transformations (eg, rotation, scaling) …

[KİTAP][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques

MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

[KİTAP][B] Simplicial partitions in global optimization

R Paulavičius, J Žilinskas, R Paulavičius, J Žilinskas - 2014 - Springer
Simplicial Partitions in Global Optimization | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …

Metaheuristic vs. deterministic global optimization algorithms: The univariate case

DE Kvasov, MS Mukhametzhanov - Applied Mathematics and Computation, 2018 - Elsevier
Many practical problems involve the search for the global extremum in the space of the
system parameters. The functions to be optimized are often highly multiextremal, black-box …

[KİTAP][B] Non-convex multi-objective optimization

Optimization is a very broad field of research with a wide spectrum of important applications.
Until the 1950s, optimization was understood as a single-objective optimization, ie, as the …

The 3D-3D registration problem revisited

H Li, R Hartley - 2007 IEEE 11th international conference on …, 2007 - ieeexplore.ieee.org
We describe a new framework for globally solving the 3D-3D registration problem with
unknown point correspondences. This problem is significant as it is frequently encountered …