A Granular Sieving Algorithm for Deterministic Global Optimization

07/14/2021
by   Tao Qian, et al.
0

A gradient-free deterministic method is developed to solve global optimization problems for Lipschitz continuous functions defined in arbitrary path-wise connected compact sets in Euclidean spaces. The method can be regarded as granular sieving with synchronous analysis in both the domain and range of the objective function. With straightforward mathematical formulation applicable to both univariate and multivariate objective functions, the global minimum value and all the global minimizers are located through two decreasing sequences of compact sets in, respectively, the domain and range spaces. The algorithm is easy to implement with moderate computational cost. The method is tested against extensive benchmark functions in the literature. The experimental results show remarkable effectiveness and applicability of the algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2022

Low Regret Binary Sampling Method for Efficient Global Optimization of Univariate Functions

In this work, we propose a computationally efficient algorithm for the p...
research
09/01/2021

A Gradient Sampling Algorithm for Stratified Maps with Applications to Topological Data Analysis

We introduce a novel gradient descent algorithm extending the well-known...
research
01/31/2018

A Cross Entropy based Optimization Algorithm with Global Convergence Guarantees

The cross entropy (CE) method is a model based search method to solve op...
research
11/27/2014

Bi-objective Optimization for Robust RGB-D Visual Odometry

This paper considers a new bi-objective optimization formulation for rob...
research
10/14/2020

Boosting One-Point Derivative-Free Online Optimization via Residual Feedback

Zeroth-order optimization (ZO) typically relies on two-point feedback to...
research
01/13/2018

On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales

The necessity to find the global optimum of multiextremal functions aris...
research
03/13/2019

Effective local compactness and the hyperspace of located sets

We revisit the definition of effective local compactness, and propose an...

Please sign up or login with your details

Forgot password? Click here to reset