Pages that link to "Item:Q1186279"
From MaRDI portal
The following pages link to Convergence rates of a global optimization algorithm (Q1186279):
Displaying 12 items.
- Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) (← links)
- Multidimensional bisection: the performance and the context (Q686996) (← links)
- Univariate global optimization with multiextremal non-differentiable constraints without penalty functions (Q853549) (← links)
- On the investigation of the practical convergence of an algorithm of global optimization (Q1309090) (← links)
- The method of global optimization of a function and estimation of the speed of its convergence (Q1342603) (← links)
- On the convergence rate issues of general Markov search for global minimum (Q1685583) (← links)
- On convergence rate of a rectangular partition based global optimization algorithm (Q1754460) (← links)
- Convergence of line search methods for unconstrained optimization (Q1881700) (← links)
- New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
- An algorithm for solving global optimization problems with nonlinear constraints (Q1913609) (← links)
- Rates of Convergence for a Class of Global Stochastic Optimization Algorithms (Q4702339) (← links)
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise (Q4997171) (← links)
