Test problems for Lipschitz univariate global optimization with multiextremal constraints
From MaRDI portal
Recommendations
- Univariate algorithms for solving global optimization problems with multiextremal non-differentiable constraints
- scientific article; zbMATH DE number 757681
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
Cited in
(9)- A generalization of the construction of test problems for nonconvex optimization
- Best practices for comparing optimization algorithms
- A perturbed version of an inexact generalized Newton method for solving nonsmooth equations
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- Univariate algorithms for solving global optimization problems with multiextremal non-differentiable constraints
- Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
- Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
- A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)
This page was built for publication: Test problems for Lipschitz univariate global optimization with multiextremal constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999080)
