Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality

In this paper, we propose nonlinear conjugate gradient methods for unconstrained set optimization problems in which the objective function is given by a finite number of continuously differentiable vector-valued functions. First, we provide a general algorithm for the conjugate gradient method using...

Full description

Bibliographic Details

Published in:	Optimization Vol. 74; no. 15; pp. 3839 - 3878
Main Authors:	Kumar, Krishan, Ghosh, Debdas, Yao, Jen-Chih, Zhao, Xiaopeng
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis 18.11.2025 Taylor & Francis LLC
Subjects:	Algorithms Conjugate gradient method Convergence Convexity Methods Optimization Parameters Set-valued optimization Steepest descent method Vectors (mathematics) weakly minimal solutions Wolfe line search Zoutendijk-type condition
ISSN:	0233-1934, 1029-4945
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!