Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
From MaRDI portal
Publication:5925738
DOI10.1023/A:1004613001755zbMath0969.90068OpenAlexW1686955344MaRDI QIDQ5925738
Publication date: 19 February 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004613001755
Related Items (20)
Diagonal generalizaton of the DIRECT method for problems with constraints ⋮ Univariate global optimization with multiextremal non-differentiable constraints without penalty functions ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ Lipschitz global optimization methods in control problems ⋮ Continuous global optimization of multivariable functions based on Sergeev and Kvasov diagonal approach ⋮ Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ Numerical methods using two different approximations of space-filling curves for black-box global optimization ⋮ Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ Continued fractions as dynamical systems ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants ⋮ An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section ⋮ Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms ⋮ The DIRECT algorithm: 25 years later ⋮ Novel global optimization algorithm with a space-filling curve and integral function ⋮ Multidimensional Lipschitz global optimization based on efficient diagonal partitions ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended univariate algorithms for \(n\)-dimensional global optimization
- The cubic algorithm
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- Global optimization using interval analysis - the multi-dimensional case
- Multidimensional bisection applied to global optimisation
- Convergence qualification of adaptive partition algorithms in global optimization
- The bisection method in higher dimensions
- Accelerations for a variety of global optimization methods
- Lipschitzian optimization without the Lipschitz constant
- Space-filling curves
- Handbook of global optimization
- A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- A deterministic algorithm for global optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- A new multisection technique in interval methods for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- New results on verified global optimization
- On generalized bisection of 𝑛-simplices
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Subdivision Direction Selection in Interval Methods for Global Optimization
- An Information Global Optimization Algorithm with Local Tuning
- Space filling curves and mathematical programming
- Acceleration tools for diagonal information global optimization
This page was built for publication: Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
