Accelerations for a variety of global optimization methods
From MaRDI portal
Recommendations
- A variational perspective on accelerated methods in optimization
- Accelerations for global optimization covering methods using second derivatives
- Some new acceleration mechanisms in verified global optimization
- Two acceleration mechanisms in verified global optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Accelerated methods for nonconvex optimization
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- Fast stochastic global optimization
- The convergence speed of interval methods for global optimization
- Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
Cites work
- A Sequential Method Seeking the Global Maximum of a Function
- A deterministic algorithm for global optimization
- An algorithm for finding the absolute extremum of a function
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Customizing methods for global optimization -- a geometric viewpoint
- Multidimensional bisection applied to global optimisation
- The bisection method in higher dimensions
Cited in
(14)- Global optimization method with numerically calculated function derivatives
- scientific article; zbMATH DE number 1268598 (Why is no real title available?)
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Two acceleration mechanisms in verified global optimization
- On Hölder global optimization method using piecewise affine bounding functions
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Objective acceleration for unconstrained optimization
- Multidimensional global optimization using numerical estimates of objective function derivatives
- Accelerating optimization by tracing valley
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Global one-dimensional optimization using smooth auxiliary functions
- Accelerations for global optimization covering methods using second derivatives
- On convergence of "divide the best" global optimization algorithms
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
This page was built for publication: Accelerations for a variety of global optimization methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315439)
