Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
From MaRDI portal
(Redirected from Publication:1754443)
Recommendations
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Simplicial Lipschitz optimization without the Lipschitz constant
- scientific article; zbMATH DE number 5707333
- scientific article; zbMATH DE number 1795727
Cites work
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A locally-biased form of the DIRECT algorithm.
- A modified DIRECT algorithm with bilevel partition
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- A partition-based global optimization algorithm
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- Additive scaling and the \texttt{DIRECT} algorithm
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Convex analysis and global optimization
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Efficient partition of N-dimensional intervals in the framework of one-point-based algorithms
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Encyclopedia of Optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Global optimization based on a statistical model and simplicial partitioning.
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Globally-biased disimpl algorithm for expensive global optimization
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Incorporating minimum Frobenius norm models in direct search
- Introduction to global optimization
- Lipschitz global optimization methods in control problems
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Lipschitzian optimization without the Lipschitz constant
- Local tuning and partition strategies for diagonal GO methods
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- On convergence of "divide the best" global optimization algorithms
- On determining the cover of a simplex by spheres centered at its vertices
- On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
- Simplicial global optimization
- Simplicial Lipschitz optimization without the Lipschitz constant
- Stochastic global optimization.
Cited in
(20)- 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
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- The DIRECT algorithm: 25 years later
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- On a new smoothing technique for non-smooth, non-convex optimization
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- Simplicial Lipschitz optimization without the Lipschitz constant
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- scientific article; zbMATH DE number 5707333 (Why is no real title available?)
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- 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
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- A new global optimization algorithm based on space-filling curve and auxiliary function approach and its applications
- Diagonal generalizaton of the DIRECT method for problems with constraints
- DIRECT algorithm: A new definition of potentially optimal hyperrectangles
This page was built for publication: Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754443)
