A new scaled-gradient non-monotone line-search algorithm for constrained optimization achieves linear convergence under strong quasiconvexity and shows competitive performance on pseudo-convex and strongly quasiconvex test problems.
Mimeographed Lecture Notes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Scaled Gradient Modified Non-monotone Line Search Method for Constrained Optimization Problems
A new scaled-gradient non-monotone line-search algorithm for constrained optimization achieves linear convergence under strong quasiconvexity and shows competitive performance on pseudo-convex and strongly quasiconvex test problems.