Pages that link to "Item:Q1850829"
From MaRDI portal
The following pages link to Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints (Q1850829):
Displaying 16 items.
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function (Q386486) (← links)
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization (Q727229) (← links)
- Univariate global optimization with multiextremal non-differentiable constraints without penalty functions (Q853549) (← links)
- A new global optimization method for univariate constrained twice-differentiable NLP problems (Q946347) (← links)
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set (Q1675572) (← links)
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
- Solving a set of global optimization problems by the parallel technique with uniform convergence (Q1754445) (← links)
- Efficient multicriterial optimization based on intensive reuse of search information (Q1754449) (← links)
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints (Q2156486) (← links)
- Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework (Q2156906) (← links)
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives (Q2199788) (← links)
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms (Q2229118) (← links)
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871) (← links)
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes (Q2422874) (← links)
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints (Q2458907) (← links)
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics (Q2660836) (← links)