MinFinder: locating all the local minima of a function
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3711761 (Why is no real title available?)
- scientific article; zbMATH DE number 3712697 (Why is no real title available?)
- A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
- A new approach to variable metric algorithms
- A stochastic method for global optimization
- A tolerant algorithm for linearly constrained optimization calculations
- Algorithm 829
- Handbook of test problems in local and global optimization
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Optimization by simulated annealing
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Tabu search applied to global optimization
- Topographical multilevel single linkage
Cited in
(8)- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
- A stochastic optimization algorithm for analyzing planar central and balanced configurations in the \(n\)-body problem
- MinFinder
- An algorithm for locating all local minima of multidimensional function
- Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain
- Approximating the objective function's gradient using perceptrons for constrained minimization with application in drag reduction
- MinFinder v2.0: an improved version of minfinder
- On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods
This page was built for publication: MinFinder: locating all the local minima of a function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709933)