A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
From MaRDI portal
Publication:2047183
Recommendations
- A DIRECT-type approach for derivative-free constrained global optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- The DIRECT algorithm: 25 years later
- GLODS: global and local optimization using direct search
Cites work
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A DIRECT-type approach for derivative-free constrained global optimization
- A locally-biased form of the DIRECT algorithm.
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- A partition-based global optimization algorithm
- A Sequential Method Seeking the Global Maximum of a Function
- Additive scaling and the \texttt{DIRECT} algorithm
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Algorithms for noisy problems in gas transmission pipeline optimization
- An algorithm for finding the absolute extremum of a function
- An approach to constrained global optimization based on exact penalty functions
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Deterministic global optimization. An introduction to the diagonal approach
- Diagonal generalizaton of the DIRECT method for problems with constraints
- Encyclopedia of optimization. In 6 vols.
- Filter-based DIRECT method for constrained global optimization
- Gaussian process optimization with failures: classification and convergence proof
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- 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 3691091 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints
- Lipschitzian optimization without the Lipschitz constant
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- MultiMin
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- On convergence of "divide the best" global optimization algorithms
- Optimization of automotive valve train components with implicit filtering
- Optimization with hidden constraints and embedded Monte Carlo computations
- Safe global optimization of expensive noisy black-box functions in the -Lipschitz framework
- Sequential model based optimization of partially defined functions under unknown constraints
- Simplicial global optimization
- Simplicial Lipschitz optimization without the Lipschitz constant
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- The DIRECT algorithm: 25 years later
- Using DIRECT to solve an aircraft routing problem
Cited in
(5)- Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
- A new partition method for DIRECT-type algorithm based on minimax design
- A taxonomy of constraints in black-box simulation-based optimization
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
Describes a project that uses
Uses Software
This page was built for publication: A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2047183)
