A deterministic algorithm for global optimization
Mathematical Programming: Series A and B
Lipschitzian optimization without the Lipschitz constant
Journal of Optimization Theory and Applications
Global one-dimensional optimization using smooth auxiliary functions
Mathematical Programming: Series A and B
Journal of Optimization Theory and Applications
Recent developments and trends in global optimization
Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
Recent trends in numerical analysis
Recent trends in numerical analysis
SIAM Journal on Optimization
A Global Optimization Algorithm for Multivariate Functionswith Lipschitzian First Derivatives
Journal of Global Optimization
Efficient Global Optimization of Expensive Black-Box Functions
Journal of Global Optimization
A Locally-Biased form of the DIRECT Algorithm
Journal of Global Optimization
Dynamic Data Structures for a Direct Search Algorithm
Computational Optimization and Applications
ACM Transactions on Mathematical Software (TOMS)
Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
SIAM Journal on Optimization
Additive Scaling and the DIRECT Algorithm
Journal of Global Optimization
Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications)
Surface passivation optimization using DIRECT
Journal of Computational Physics
Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
Journal of Global Optimization
A fully adaptive hybrid optimization of aircraft engine blades
Journal of Computational and Applied Mathematics
Lipschitz and Hölder global optimization using space-filling curves
Applied Numerical Mathematics
TRIOPT: a triangulation-based partitioning algorithm for global optimization
Journal of Computational and Applied Mathematics
An information global minimization algorithm using the local improvement technique
Journal of Global Optimization
A partition-based global optimization algorithm
Journal of Global Optimization
A metamodel-assisted evolutionary algorithm for expensive optimization
Journal of Computational and Applied Mathematics
Lipschitz global optimization methods in control problems
Automation and Remote Control
A modification of the DIRECT method for Lipschitz global optimization for a symmetric function
Journal of Global Optimization
Simplicial Lipschitz optimization without the Lipschitz constant
Journal of Global Optimization
Hi-index | 7.29 |
A global optimization problem is studied where the objective function f(x) is a multidimensional black-box function and its gradient f^'(x) satisfies the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant K. Different methods for solving this problem by using an a priori given estimate of K, its adaptive estimates, and adaptive estimates of local Lipschitz constants are known in the literature. Recently, the authors have proposed a one-dimensional algorithm working with multiple estimates of the Lipschitz constant for f^'(x) (the existence of such an algorithm was a challenge for 15 years). In this paper, a new multidimensional geometric method evolving the ideas of this one-dimensional scheme and using an efficient one-point-based partitioning strategy is proposed. Numerical experiments executed on 800 multidimensional test functions demonstrate quite a promising performance in comparison with popular DIRECT-based methods.