Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions
This paper introduces an innovative extension of the DIRECT algorithm specifically designed to solve global optimization problems that involve Lipschitz continuous functions subject to linear constraints. Our approach builds upon recent advancements in DIRECT-type algorithms, incorporating novel tec...
Main Authors: | Linas Stripinis, Remigijus Paulavičius |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/11/13/2920 |
Similar Items
-
Experimental Study of Excessive Local Refinement Reduction Techniques for Global Optimization DIRECT-Type Algorithms
by: Linas Stripinis, et al.
Published: (2022-10-01) -
Analysis of different norms and corresponding Lipschitz constants for global optimization
by: Remigijus Paulavičius, et al.
Published: (2006-12-01) -
A constrained multi-objective optimization algorithm using an efficient global diversity strategy
by: Wenyi Long, et al.
Published: (2022-09-01) -
Global optimization using the branch‐and‐bound algorithm with a combination of Lipschitz bounds over simplices
by: Remigijus Paulavičius, et al.
Published: (2009-06-01) -
Improved Lipschitz bounds with the first norm for function values over multidimensional simplex
by: Remigijus Paulavičius, et al.
Published: (2008-12-01)