Optimal Design Using Chaotic Descent Method
Journal of Mechanical Design1998Vol. 122(3), pp. 265–270
Citations Over Time
Abstract
This paper describes a method for searching of global minima in design optimization problems. The method is applicable to any general nonlinear function. It is based on utilizing sensitive fractal areas to locate all of the solutions along one direction in a variable space. The search begins from an arbitrary chosen point in the variable space and descends towards a better design along a randomly chosen direction. Descent depends on finding points that belong to a fractal set which can be used to locate all of the solutions along that direction. The process is repeated until optimal design is obtained. To examine the behavior of the algorithm appropriate examples were selected and results discussed. [S1050-0472(00)00703-0]
Related Papers
- → Locating the local minima in lens design with machine learning(2021)3 cited
- → A Strategy to Solve the Local Minima Problem for Autonomous Mechanical Vehicles(2012)1 cited
- → Eliminating all bad Local Minima from Loss Landscapes without even adding an Extra Unit(2019)3 cited
- A USEFUL BP ALGORITHM TO OVERCOME LOCAL MINIMA(1995)
- Faster escaping from local minima for back-propagation algorithm(2008)