Journal article · 2024
Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality
Optimization, 74(15), 3839–3878 · Published 14 August 2024 · DOI 10.1080/02331934.2024.2390116
In brief
“Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality” is a 2024 journal article by Krishan Kumar and 3 co-authors, published in Optimization. OpenAlex counts 9 citations as of 16 November 2026, which puts it in the top 4% of works published in 2024 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 9
- Most cited in
- 2025 (6)
- Field-weighted impact
- 2.35
- References
- 34
- Authors
- 4
Abstract
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 Wolfe line search but without imposing an explicit restriction on the conjugate parameter.… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Kumar, K., Ghosh, D., Yao, J., & Zhao, X. (2024). Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality. Optimization, 74(15), 3839–3878. https://doi.org/10.1080/02331934.2024.2390116
MLA 9
Kumar, Krishan, et al. “Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality.” Optimization, vol. 74, no. 15, 2024, pp. 3839–3878. https://doi.org/10.1080/02331934.2024.2390116.
Chicago
Kumar, Krishan, Debdas Ghosh, Jen‐Chih Yao, and Xiaopeng Zhao. 2024. “Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality.” Optimization 74 (15): 3839–3878. https://doi.org/10.1080/02331934.2024.2390116.
Harvard
Kumar, K. et al. (2024) ‘Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality’, Optimization, 74(15), pp. 3839–3878. doi:10.1080/02331934.2024.2390116.
IEEE
K. Kumar, D. Ghosh, J. Yao, and X. Zhao, “Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality,” Optimization, vol. 74, no. 15, pp. 3839–3878, 2024, doi: 10.1080/02331934.2024.2390116.
BibTeX
@article{kumar2024nonlinear,
title = {{Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality}},
author = {Kumar, Krishan and Ghosh, Debdas and Yao, Jen‐Chih and Zhao, Xiaopeng},
journal = {Optimization},
year = {2024},
volume = {74},
number = {15},
pages = {3839--3878},
doi = {10.1080/02331934.2024.2390116},
url = {https://doi.org/10.1080/02331934.2024.2390116}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- nonlinear conjugate gradient
- set optimization
- unconstrained optimization
- multi-objective optimization
- Wolfe line search
- Fletcher-Reeves method
- global convergence
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Kumar, K., Ghosh, D., Yao, J., & Zhao, X. (2024). Nonlinear conjugate gradient methods for unconstrained set optimization problems whose objective functions have finite cardinality. Optimization, 74(15), 3839–3878. https://doi.org/10.1080/02331934.2024.2390116
How many times has this paper been cited?
9 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Krishan Kumar, Debdas Ghosh, Jen‐Chih Yao, Xiaopeng Zhao.
What is the DOI of this paper?
10.1080/02331934.2024.2390116. The permanent link is https://doi.org/10.1080/02331934.2024.2390116.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.