PERFORMANCE ASSESSMENT OF STEEPEST DESCENT METHOD CONSIDERING GRADIENT BASED LINE SEARCH CONDITIONS IN GEOMETRY FITTING OF 2D MEASURED PROFILES
Abstract
This paper focuses on exploring effect of the step length, used in the line search, computation techniques on the performance of steepest descent (SD) method in the geometry fitting of the 2D measured profiles. To this end, the three step length computation techniques or line search conditions accommodating Weak Wolfe (WWC), Strong Wolfe (SWC) and the exact minimizer finder have been implemented during the fitting process. To test the line search conditions performances, the 2D primitive geometry test set consisting of five different geometries such as circle, square, triangle, ellipse and rectangle have been employed. The 2D profiles of those geometries have been extracted using coordinate measuring machine (CMM) with high precision. For performance assessments, the total number of function evaluations when the SD method-line search condition combination satisfies the required converge tolerance have been used. By means of those data, the performance profiles have been created to conduct reliable and efficient assessments on the line search conditions. The results have shown that the step length computation technique plays a crucial role for the SD method performance. Based on the performance profiles, it has been determined that the fastest line search condition is the WWC. Besides that, it has been revealed that the optimum technique is the exact minimizer finder for the geometry fitting process in the study.
Keywords
Steepest descent method, Performance profiles, Line search, Geometry fitting, Optimization
Supporting Institution
Herhangi bir destekleyen kurum yoktur.
Thanks
The author acknowledges Design and Manufacturing Technologies Research Laboratory, Innovative Technologies Application and Research Center, Suleyman Demirel University where the experimental work in this study was performed.
References
- Cauchy A. Methode generale pour la resolution des systemes d’equations simultanees. Comp. Rend. Sci. Paris 1847; 25(2): 536-538.
- Bento G., da Cruz Neto J.X., Santos P. An inexact steepest descent method for multicriteria optimization on riemannian manifolds. Journal of Optimization Theory and Applications 2013; 159(1): 108-124.
- Haug E., Arora J., Matsui K. A steepest-descent method for optimization of mechanical systems. Journal of Optimization Theory and Applications 1976; 19(3): 401-424.
- Liu X., Reynolds A.C. A multiobjective steepest descent method with applications to optimal well control. Computational Geosciences 2016; 20(2): 355-374.
- Zhu L.M., Ding H., Xiong Y.L. A steepest descent algorithm for circularity evaluation. Computer-Aided Design 2003; 35(3): 255-265.
- Quiroz E.P., Quispe E., Oliveira P.R. Steepest descent method with a generalized armijo search for quasiconvex functions on riemannian manifolds. Journal of mathematical analysis and applications 2008; 341(1): 467-477.
- Samir C., Absil, P.A., Srivastava, A., Klassen, E. A gradient-descent method for curve fitting on riemannian manifolds. Foundations of Computational Mathematics 2012; 12(1): 49-73.
- George S., Sabari M. Convergence rate results for steepest descent type method for nonlinear ill-posed equations. Applied Mathematics and Computation 2017; 294: 169-179.
- Anjidani M., Effati S. Steepest descent method for solving zero-one nonlinear programming problems. Applied Mathematics and Computation 2007; 193: 197-202.
- Abbasbandy S., Jafarian A. Steepest descent method for solving fuzzy nonlinear equations. Applied Mathematics and Computation 2006; 174: 669-675.