A Three-Term Conjugate Gradient-Type Method with Sufficient Descent Property for Vector Optimization

Yu Chen (), Helong Chen () and Zhibin Zhu ()
Additional contact information
Yu Chen: Guangxi Normal University
Helong Chen: Guangxi Normal University
Zhibin Zhu: Guilin University of Electronic Technology

Journal of Optimization Theory and Applications, 2026, vol. 208, issue 1, No 5, 42 pages

Abstract: Abstract The field of vector optimization represents a critical domain within the broader spectrum of optimization problems. Extensive research efforts are currently dedicated to developing solution methods for vector optimization problems. A range of classical approaches, originally designed for scalar optimization, have been adapted to address issues in vector optimization. These include techniques such as the steepest descent method, Newton’s method, quasi-Newton method and conjugate gradient method, among others. However, limited attention has been given to the three-term conjugate gradient method in the context of vector optimization. In this paper, based on the modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno (BFGS) method proposed by Kou and Dai (J. Optim. Theory Appl., 165(1): 209-224, 2015), we propose a novel three-term conjugate gradient-type method specifically designed for vector optimization problems. This method ensures the sufficient descent property independent of any line search strategy. Furthermore, the improved Wolfe line search is extended to vector optimization. The global convergence of the proposed method under the improved Wolfe line search is analyzed, demonstrating that at least one accumulation point of the sequence generated by the proposed algorithm is a K-critical point of vector optimization problem. Numerical experiments conducted on a set of benchmark test problems highlight the effectiveness of the proposed method compared to some existing gradient-based approaches.

Keywords: Unconstrained vector optimization; Three-term conjugate gradient-type method; Sufficient descent condition; Global convergence; 49J52; 90C33 (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-025-02815-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:208:y:2026:i:1:d:10.1007_s10957-025-02815-0

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-025-02815-0

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().