An algorithm for finding a root of a nonnegative multimodal function
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3718485 (Why is no real title available?)
- A Search Algorithm for the Global Extremum of a Discontinuous Function
- A Sequential Method Seeking the Global Maximum of a Function
- Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- An algorithm for finding the absolute extremum of a function
- An application of the nonuniform covering method to the global optimization of mixed integer nonlinear problems
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Interval branch and bound algorithm for finding the first-zero-crossing-point in one-dimensional functions
- Lipschitz global optimization methods in control problems
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- Parallel characteristical algorithms for solving problems of global optimization
- Parallelization of the global extremum searching process
- Piyavskij's method for solving the general global optimization problem
- Simplicial global optimization
- The DIRECT algorithm: 25 years later
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
This page was built for publication: An algorithm for finding a root of a nonnegative multimodal function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240926)
