A Scaled Gradient Modified Non-monotone Line Search Method for Constrained Optimization Problems

In this paper, we propose a scaled gradient modified non-monotone line search method for solving constrained minimization problems, and explore several specific properties of this method, namely, its convergence analysis. We discuss the linear convergence rate of the sequence generated by the proposed algorithm to a solution of the constrained minimization problem where the objective function is strongly quasiconvex. We consider numerical examples of large-scale fractional programming and quadratic programming for the function of pseudo convex and strongly quasiconvex and compare the performance of the proposed algorithm with the existing ones for these examples.

Source: arXiv:2604.28110v1 - http://arxiv.org/abs/2604.28110v1 PDF: https://arxiv.org/pdf/2604.28110v1 Original Link: http://arxiv.org/abs/2604.28110v1