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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Ansari, Qamrul Hasan, Babu, Feeroz, Sahu, D. R., Yao, Jen Chih
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866909005161431040
author Ansari, Qamrul Hasan
Babu, Feeroz
Sahu, D. R.
Yao, Jen Chih
author_facet Ansari, Qamrul Hasan
Babu, Feeroz
Sahu, D. R.
Yao, Jen Chih
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2604_28110
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A Scaled Gradient Modified Non-monotone Line Search Method for Constrained Optimization Problems
Ansari, Qamrul Hasan
Babu, Feeroz
Sahu, D. R.
Yao, Jen Chih
Optimization and Control
Functional Analysis
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.
title A Scaled Gradient Modified Non-monotone Line Search Method for Constrained Optimization Problems
topic Optimization and Control
Functional Analysis
url https://arxiv.org/abs/2604.28110