2021/07/05 by Danijela Protić, Protic, Danijela, Miomir Stanković +1
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Iterative Methods for Nonlinear Equations #Numerical Analysis (math.NA) #Numerical Methods and Algorithms #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.2107.03304
openalex publication_date 2021/07/05 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
A q-Levenberg-Marquardt method is an iterative procedure that blends a\nq-steepest descent and q-Gauss-Newton methods. When the current solution is far\nfrom the correct one the algorithm acts as the q-steepest descent method.\nOtherwise the algorithm acts as the q-Gauss-Newton method. A damping parameter\nis used to interpolate between these two methods. The q-parameter is used to\nescape from local minima and to speed up the search process near the optimal\nsolution.\n