Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
From MaRDI portal
Publication:1754443
DOI10.1007/s10898-016-0485-6zbMath1402.90134OpenAlexW2564215984MaRDI QIDQ1754443
Lakhdar Chiter, Remigijus Paulavičius, Julius Žilinskas
Publication date: 30 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0485-6
Related Items (11)
On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Branch-and-Model: a derivative-free global optimization algorithm ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ Guest editors' preface to the special issue devoted to the 2nd international conference ``Numerical computations: theory and algorithms, June 19--25, 2016, Pizzo Calabro, Italy ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ The DIRECT algorithm: 25 years later ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ On a new smoothing technique for non-smooth, non-convex optimization
Uses Software
Cites Work
- Unnamed Item
- Lipschitz global optimization methods in control problems
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- A modified DIRECT algorithm with bilevel partition
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- On determining the cover of a simplex by spheres centered at its vertices
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Additive scaling and the \texttt{DIRECT} algorithm
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- Incorporating minimum Frobenius norm models in direct search
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Lipschitzian optimization without the Lipschitz constant
- Local tuning and partition strategies for diagonal GO methods
- Global optimization based on a statistical model and simplicial partitioning.
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
- Introduction to global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A partition-based global optimization algorithm
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Stochastic global optimization.
- Simplicial Global Optimization
- Encyclopedia of Optimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- On convergence of "divide the best" global optimization algorithms
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Convex analysis and global optimization
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- A locally-biased form of the DIRECT algorithm.
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
This page was built for publication: Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
