Nonlinear Conjugate Gradient Methods for Optimization of Set-Valued Mappings of Finite Cardinality Article Swipe

MAKE IMPACT

Debdas Ghosh , Ravi Raushan , Zai-Yun Peng , Jen‐Chih Yao · YOU? · · 2024 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2412.20168

This article presents nonlinear conjugate gradient methods for finding local weakly minimal points of set-valued optimization problems under a lower set less ordering relation. The set-valued objective function of the optimization problem under consideration is defined by finitely many continuously differentiable vector-valued functions. For such optimization problems, at first, we propose a general scheme for nonlinear conjugate gradient methods and then introduce Dai-Yuan, Polak-Ribi{è}re-Polyak, and Hestenes-Stiefel conjugate gradient parameters for set-valued functions. Toward deriving the general scheme, we introduce a condition of sufficient decrease and Wolfe line searches for set-valued functions. For a given sequence of descent directions of a set-valued function, it is found that if the proposed standard Wolfe line search technique is employed, then the generated sequence of iterates for set optimization follows a Zoutendijk-like condition. With the help of the derived Zoutendijk-like condition, we report that all the proposed nonlinear conjugate gradient schemes are globally convergent under usual assumptions. It is important to note that the ordering cone used in the entire study is not restricted to be finitely generated, and no regularity assumption on the solution set of the problem is required for any of the reported convergence analyses. Finally, we demonstrate the performance of the proposed methods through numerical experiments. In the numerical experiments, we demonstrate the effectiveness of the proposed methods not only on the commonly used test instances for set optimization but also on a few newly introduced problems under general ordering cones that are neither nonnegative hyper-octant nor finitely generated.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/2412.20168

PDF

https://arxiv.org/pdf/2412.20168

OA Status

green

Related Works

10

OpenAlex ID

https://openalex.org/W4405955657

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W4405955657

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.48550/arxiv.2412.20168

Digital Object Identifier

Title

Nonlinear Conjugate Gradient Methods for Optimization of Set-Valued Mappings of Finite Cardinality

Work title

Type

preprint

OpenAlex work type

Language

en

Primary language

Publication year

2024

Year of publication

Publication date

2024-12-28

Full publication date if available

Authors

Debdas Ghosh, Ravi Raushan, Zai-Yun Peng, Jen‐Chih Yao

List of authors in order

Landing page

https://arxiv.org/abs/2412.20168

Publisher landing page

PDF URL

https://arxiv.org/pdf/2412.20168

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/2412.20168

Direct OA link when available

Concepts

Cardinality (data modeling), Conjugate gradient method, Set (abstract data type), Conjugate, Nonlinear system, Finite set, Mathematical optimization, Mathematics, Nonlinear conjugate gradient method, Computer science, Gradient descent, Mathematical analysis, Artificial intelligence, Data mining, Programming language, Physics, Quantum mechanics, Artificial neural network

Top concepts (fields/topics) attached by OpenAlex

Cited by

0

Total citation count in OpenAlex

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload