A multi-start global minimization algorithm with dynamic search trajectories
From MaRDI portal
Publication:1078079
DOI10.1007/BF00940408zbMath0595.90073OpenAlexW1983270553MaRDI QIDQ1078079
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940408
global optimizationglobal minimumpotential energymulti-start algorithmconservative force fieldglobal unconstrained minimizationsearch trajectories
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
A dynamic penalty function method for the solution of structural optimization problems ⋮ Global optimization conditions for certain nonconvex minimization problems ⋮ Fuzzy relational clustering based on comparing two proximity matrices with utilization of particle swarm optimization ⋮ Solving multifacility Huff location models on networks using metaheuristic and exact approaches ⋮ Design of laminated composite plates for optimal dynamic characteristics using a constrained global optimization technique ⋮ Global minimum cost design of a welded square stiffened plate supported at four corners ⋮ Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme ⋮ A new filled function applied to global optimization. ⋮ The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization ⋮ A new filled function for unconstrained global optimization ⋮ Diffusion equation method of global minimization: Performance for standard test functions ⋮ A filled function method for global optimization with inequality constraints ⋮ A design algorithm for the optimization of laminated composite structures ⋮ Dynamic search trajectory methods for global optimization ⋮ A deterministic algorithm for global optimization ⋮ Dynamic globally concavized filled function method for continuous global optimization ⋮ A trajectory-followed method for unconstrained optimization ⋮ A filled function which has the same local minimizer of the objective function ⋮ A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization ⋮ Design of laminated composite plates for maximum buckling load and vibration frequency ⋮ Several filled functions with mitigators. ⋮ Trajectory-following algorithms for min-max optimization problems ⋮ Lipschitzian optimization without the Lipschitz constant
Uses Software
Cites Work
- Unnamed Item
- 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
- A new and dynamic method for unconstrained minimization
- A stochastic method for global optimization
- Stochastic Methods for Global Optimization
- A New Method for Solving Nonlinear Simultaneous Equations
