A multi-start global minimization algorithm with dynamic search trajectories
A new multi-start algorithm for global unconstrained minimization is presented in which the search trajectories are derived from the equation of motion of a particle in a conservative force field, where the function to be minimized represents the potential energy. The trajectories are modified to increase the probability of convergence to a comparatively low local minimum, thus increasing the region of convergence of the global minimum. A Bayesian argument is adopted by which, under mild assumptions, the confidence level that the global minimum has been attained may be computed. When applied to standard and other test functions, the algorithm never failed to yield the global minimum.
- A new and dynamic method for unconstrained minimization
- A New Method for Solving Nonlinear Simultaneous Equations
- A stochastic method for global optimization
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Generalized descent for global optimization
- Global optimization by controlled random search
- scientific article; zbMATH DE number 3426675 (Why is no real title available?)
- Stochastic Methods for Global Optimization
- Dynamic globally concavized filled function method for continuous global optimization
- A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
- A trajectory-followed method for unconstrained optimization
- Design of laminated composite plates for maximum buckling load and vibration frequency
- Trajectory-following algorithms for min-max optimization problems
- Lipschitzian optimization without the Lipschitz constant
- A dynamic penalty function method for the solution of structural optimization problems
- Global optimization conditions for certain nonconvex minimization problems
- Evolutionary operators in global optimization with dynamic search trajectories
- A new filled function applied to global optimization.
- Solving multifacility Huff location models on networks using metaheuristic and exact approaches
- The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization
- A deterministic algorithm for global optimization
- Several filled functions with mitigators.
- Global optimization using dynamic search trajectories
- Design of laminated composite plates for optimal dynamic characteristics using a constrained global optimization technique
- Diffusion equation method of global minimization: Performance for standard test functions
- Dynamic search trajectory methods for global optimization
- A filled function which has the same local minimizer of the objective function
- A new filled function for unconstrained global optimization
- scientific article; zbMATH DE number 994717 (Why is no real title available?)
- scientific article; zbMATH DE number 3876492 (Why is no real title available?)
- Global minimum cost design of a welded square stiffened plate supported at four corners
- scientific article; zbMATH DE number 1795720 (Why is no real title available?)
- A design algorithm for the optimization of laminated composite structures
- Finding global minima with a new dynamical evolutionary algorithm.
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- Global minimum search using DMC algorithm with continuous weights
- Projection of a Point onto a Convex Set via Charged Balls Method
- A new filled function method for solving constrained global optimization problems
- A filled function method for global optimization with inequality constraints
- Fuzzy relational clustering based on comparing two proximity matrices with utilization of particle swarm optimization
This page was built for publication: A multi-start global minimization algorithm with dynamic search trajectories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078079)