On exact line search method for a polynomial matrix equation
In this work, we investigate the elementwise minimal non-negative (EMN) solution of the matrix polynomial equation using an exact line search (ELS) technique to enhance the convergence of the Newton method. Nonnegative solutions to matrix equations are essential in engineering, optimization, signal processing, and data mining, driving advancements and improving efficiency in these fields. While recent advancements in solving matrix equations with nonnegative constraints have emphasized iterative methods, optimization strategies, and theoretical developments, efficiently finding the EMN solution remains a significant challenge. The proposed method integrates the Newton method with an exact line search (ELS) strategy to accelerate convergence and improve solution accuracy. Numerical experiments demonstrate that this approach requires fewer iterations to reach the EMN solution compared to the standard Newton method. Moreover, the method shows improved stability, particularly when dealing with ill-conditioned input matrices and very small tolerance errors. • Comparison of Pure Newton method with Exact Line Search method. • Exact Line Search strategy improves convergence speed and computational efficiency. • Pure Newton’s Method with Exact Line Search achieves better precision and stability, even for large matrices. • Practical advantages in optimization, signal processing, and data mining.
Authors
- Chacha Stephen Chacha (ORCID: https://orcid.org/0000-0001-8378-9219)
Publication Details
- Journal
- Journal of Computational Mathematics and Data Science
- Published
- 2025-05-27
- DOI
- https://doi.org/10.1016/j.jcmds.2025.100120
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00