Hybridization of two conjugate gradient methods for multiobjective optimization beyond convexity and Lipschitz continuity
Computer Science
Similar papers
Jul 2026
New Globalized Newton-Type Methods for Nonconvex Optimization Problems
This paper proposes a general line-search Newton framework for unconstrained optimization that avoids repeated Hessian regularization by exploiting the Newton direction only when it is well-defined and suitable and provides the first Newton-type algorithm together with a comprehensive convergence analysis for this impo...
Phat Thanh Vo, Tuyen Tran
· arXiv.org · 0 citations
Open access
2026
A Modified Three-Term Hestenes–Stiefel Conjugate Gradient Method with Guaranteed Descent Property
A Modified Three-Term Hestenes–Stiefel (MTTHS) conjugate gradient method that enforces the sufficient descent condition exactly, without any line search restriction is proposed.
O. Oluwafemi, J. Omolehin, S. O. Momoh et al.
· International journal of res... · 0 citations
Preprint
Aug 2026
A Wolfe-Type Spectral Conjugate Gradient Method for Nonsmooth Convex Optimization Problems
The results show that the proposed Wolfe-type spectral conjugate gradient method performs competitively overall, matching or outperforming existing methods on most problems tested, while a few specific limitations of the current implementation are also identified and discussed.
Jauny, G. Kumar
· 0 citations
Open access
Jul 2026
A Hybrid Conjugate Gradient Method for Unconstrained Optimization with Application in Image Restoration
Hybrid conjugate gradient methods are considered as an efficient family of conjugate gradient (CG) methods used to solve unconstrained optimization problems. In this paper, on account of the outstanding performance of the PRP (Polak–Ribière–Polyak) conjugate gradient method and its exceptional numerical computational s...
Jiayu Zheng, Xiangsong Zhang
· Symmetry · 0 citations
Preprint
Jul 2026
Fully Convergent Projection-based Methods with Momentum under Nonconvex Geometric
This work can specifically ensure, without any smoothness assumptions, convergence to Mordukhovich stationarity as long as the base directions asymptotically revert to the negative gradient for small stepsizes.
Matteo Lapucci, Diego Scuppa
· 0 citations
Preprint
Aug 2026
A proximal gradient method with adaptive backtracking for weakly smooth multiobjective optimization
The proposed proximal gradient method with adaptive linesearch for multiobjective optimization problems whose objective functions are weakly smooth, i.e., they have Holder continuous gradients and the algorithm accepts coercer stationarity measure compared to existing methods is established.
Yuki Miyazaki, Masaru Ito, Shotaro Yagishita
· 0 citations