A Granular Sieving Algorithm for Deterministic Global Optimization
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.
Code (0)
등록된 구현이 없습니다.
Tasks
global-optimizationSimilar Papers 제목 키워드 기반
Evolutionary techniques in lattice sieving algorithms
Lattice-based cryptography has recently emerged as a prominent candidate for secure communication in the quantum age. Its security relies on the hardness of certain lattice problems, and the inability of known lattice al…
Evolutionary AlgorithmsObject sieving and morphological closing to reduce false detections in wide-area aerial imagery
For object detection in wide-area aerial imagery, post-processing is usually needed to reduce false detections. We propose a two-stage post-processing scheme which comprises an area-thresholding sieving process and a mor…
Objectobject-detectionObject DetectionLayer Freezing & Data Sieving: Missing Pieces of a Generic Framework for Sparse Training
Recently, sparse training has emerged as a promising paradigm for efficient deep learning on edge devices. The current research mainly devotes efforts to reducing training costs by further increasing model sparsity. Howe…
Integer Factorization with a Neuromorphic Sieve
The bound to factor large integers is dominated by the computational effort to discover numbers that are smooth, typically performed by sieving a polynomial sequence. On a von Neumann architecture, sieving has log-log am…
Imbalance Prime Sieving: Every Prime Gap Is a Result of a Möbius Imbalance Obstruction
We introduce a novel sieve for prime numbers based on detecting topological obstructions in a Möbius-transformed rational metric space. Unlike traditional sieves which rely on divisibility, our method identifies primes a…