A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
From MaRDI portal
Publication:2458907
DOI10.1007/s11590-006-0015-4zbMath1122.90076arXiv1107.5280OpenAlexW1991857683MaRDI QIDQ2458907
Yaroslav D. Sergeyev, Falah M. H. Khalaf, Dmitri E. Kvasov
Publication date: 5 November 2007
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.5280
Related Items
A Search Algorithm for the Global Extremum of a Discontinuous Function, Metaheuristic vs. deterministic global optimization algorithms: the univariate case, Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives, Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms, Learning Enabled Constrained Black-Box Optimization, Sequential model based optimization of partially defined functions under unknown constraints, Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization, Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems, A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
Uses Software
Cites Work
- Unnamed Item
- Global one-dimensional optimization using smooth auxiliary functions
- Handbook of global optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- An algorithm for solving global optimization problems with nonlinear constraints
- Thevenin decomposition and large-scale optimization
- Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints
- Minimization of multiextremal functions under nonconvex constraints
- Numerical Optimization
- An algorithm for finding the absolute extremum of a function
- An Information Global Optimization Algorithm with Local Tuning