On diagonally structured scheme for nonlinear least squares and data-fitting problems

• Published in: R.A.I.R.O. Recherche opérationnelle Vol. 58; no. 4; pp. 2887 - 2905
• Main Authors: Yahaya, Mahmoud Muhammad, Kumam, Poom, Chaipunya, Parin, Awwal, Aliyu Muhammed, Wang, Lin
• Format: Journal Article
• Language: English
• Published: 01.07.2024
• ISSN: 0399-0559; 2804-7303
• DOI: 10.1051/ro/2024102

Recently, structured nonlinear least-squares (NLS) based algorithms gained considerable emphasis from researchers; this attention may result from increasingly applicable areas of these algorithms in different science and engineering domains. In this article, we coined a new efficient structured-based NLS algorithm. We developed a diagonal Hessian-based formulation for solving NLS problems. We derived the quasi-Newton update based on a diagonal matrix scheme subject to a modified structured secant condition. Also, we show that the algorithm’s search direction satisfies a sufficient descent condition under some standard assumptions. Subsequently, we also prove the global convergence of the algorithm and then eventually show its linear convergence rate for strongly convex functions. Furthermore, to show case the proposed algorithm’s performance, we experimented numerically by comparing it with other approaches on some benchmark test functions available in the literature. Finally, the introduced scheme is applied to solve some data-fitting problems