Exploiting Active Subspaces in Global Optimization: How Complex is your Problem?

07/09/2017
by   Pramudita Satria Palar, et al.
0

When applying optimization method to a real-world problem, the possession of prior knowledge and preliminary analysis on the landscape of a global optimization problem can give us an insight into the complexity of the problem. This knowledge can better inform us in deciding what optimization method should be used to tackle the problem. However, this analysis becomes problematic when the dimensionality of the problem is high. This paper presents a framework to take a deeper look at the global optimization problem to be tackled: by analyzing the low-dimensional representation of the problem through discovering the active subspaces of the given problem. The virtue of this is that the problem's complexity can be visualized in a one or two-dimensional plot, thus allow one to get a better grip about the problem's difficulty. One could then have a better idea regarding the complexity of their problem to determine the choice of global optimizer or what surrogate-model type to be used. Furthermore, we also demonstrate how the active subspaces can be used to perform design exploration and analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2019

Deep active subspaces -- a scalable method for high-dimensional uncertainty propagation

A problem of considerable importance within the field of uncertainty qua...
research
08/27/2020

Kernel-based Active Subspaces with application to CFD parametric problems using Discontinuous Galerkin method

A new method to perform a nonlinear reduction in parameter spaces is pro...
research
07/20/2023

Discovering Active Subspaces for High-Dimensional Computer Models

Dimension reduction techniques have long been an important topic in stat...
research
11/27/2019

Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization

Scaling Bayesian optimisation (BO) to high-dimensional search spaces is ...
research
05/09/2011

On the Preliminary Design of Multiple Gravity-Assist Trajectories

In this paper the preliminary design of multiple gravity-assist trajecto...
research
04/18/2017

On the choice of the low-dimensional domain for global optimization via random embeddings

The challenge of taking many variables into account in optimization prob...
research
03/07/2019

Adaptive Sample-Efficient Blackbox Optimization via ES-active Subspaces

We present a new algorithm ASEBO for conducting optimization of high-dim...

Please sign up or login with your details

Forgot password? Click here to reset