A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
From MaRDI portal
Publication:2047183
DOI10.1007/s11590-021-01726-zzbMath1475.90073OpenAlexW3143082928MaRDI QIDQ2047183
Linas Stripinis, Remigijus Paulavičius
Publication date: 19 August 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01726-z
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items (3)
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MultiMin
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- A modified DIviding RECTangles algorithm for a problem in astrophysics
- An approach to constrained global optimization based on exact penalty functions
- Filter-based DIRECT method for constrained global optimization
- Diagonal generalizaton of the DIRECT method for problems with constraints
- Additive scaling and the \texttt{DIRECT} algorithm
- Lipschitzian optimization without the Lipschitz constant
- Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints
- Optimization of automotive valve train components with implicit filtering
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Algorithms for noisy problems in gas transmission pipeline optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A partition-based global optimization algorithm
- Gaussian process optimization with failures: classification and convergence proof
- Sequential model based optimization of partially defined functions under unknown constraints
- The DIRECT algorithm: 25 years later
- Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework
- 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
- Optimization with hidden constraints and embedded Monte Carlo computations
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A DIRECT-type approach for derivative-free constrained global optimization
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- Simplicial Global Optimization
- An algorithm for finding the absolute extremum of a function
- On convergence of "divide the best" global optimization algorithms
- Deterministic Global Optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- A locally-biased form of the DIRECT algorithm.
- Using DIRECT to solve an aircraft routing problem
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
This page was built for publication: A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
