Pages that link to "Item:Q5470225"
From MaRDI portal
The following pages link to Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants (Q5470225):
Displayed 16 items.
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871) (← links)
- Optimization challenges in the structured low rank approximation problem (Q2434635) (← links)
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
- ANOVA-MOP: ANOVA Decomposition for Multiobjective Optimization (Q4561237) (← links)
- A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems (Q5080393) (← links)
- Stability Analysis of DESA Optimization Algorithm (Q5122269) (← links)
- Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization (Q5122272) (← links)
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant (Q5122335) (← links)
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)
- Granular sieving algorithm for selecting best n$$ n $$ parameters (Q6087609) (← links)
- Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization (Q6183089) (← links)
- A new partition method for DIRECT-type algorithm based on minimax design (Q6183090) (← links)
- Numerical methods using two different approximations of space-filling curves for black-box global optimization (Q6200380) (← links)
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework (Q6200381) (← links)