A Simple Novel Global Optimization Algorithm and Its Performance on Some Benchmark Functions
원문 초록
This paper propose a new frame work for finding global minima which we call optimization by cut. In each iteration, it takes some samples from the feasible region and evaluates the objective function at these points. Based on the observations it cuts off from the feasible region a subregion that is unlikely to contain a global minimum. The procedure is then repeated with the feasible region replaced by the remaining region until the remaining region is ``small'' enough. If a global minimum is kept in the remaining region of each iteration, then it can be located with an arbitrary precision. The frame work is surprisingly efficient in view of its simple form and can be applied to black-box functions since neither special structure nor derivative information is required. The performance of the proposed frame work is evaluated on some benchmark functions and the results show that it can find a global minimum rather quickly.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
NeRF-based CBCT Reconstruction needs Normalization and Initialization
A Hybrid GA LLM Framework for Structured Task Optimization
A Divide-and-Conquer Approach for Global Orientation of Non-Watertight Scene-Level Point Clouds Using 0-1 Integer Optimization
Improving LLM-based Global Optimization with Search Space Partitioning
Physics-guided and fabrication-aware inverse design of photonic devices using diffusion models
SUDO: Enhancing Text-to-Image Diffusion Models with Self-Supervised Direct Preference Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.