Journal article · 2026 · Open access

Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions

Anshika, Debdas Ghosh, Qamrul Hasan Ansari, Xiaopeng Zhao

Optimization methods & software, 1–46 · Published 16 September 2026 · DOI 10.1080/10556788.2026.2710699

Free PDFView at the publisherCite this paper

In brief

“Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions” is a 2026 journal article by Anshika and 3 co-authors, published in Optimization methods & software. OpenAlex counts 6 citations as of 16 November 2026, which puts it in the top 7% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
6
Most cited in
2026 (4)
Field-weighted impact
9.49
References
29
Authors
4

Abstract

In this paper, we propose a Newton method for unconstrained set optimization problems to find their weakly minimal solutions with respect to lower set-less ordering. The objective function of the problem under consideration is given by finitely many strongly convex twice continuously differentiable vector-valued functions. At first, with the help of a family of vector optimization problems and the Gerstewitz scalarizing function, we identify a necessary optimality condition for weakly minimal solutions of the considered problem. In the proposed Newton method, we derive a sequence of iterative points that converges locally to a point satisfying the necessary optimality condition for weakly minimal points. To find this sequence of iterates, we formulate a family of vector optimization problems using the partition set concept. Then, we find a descent direction for the family of vector optimization problems obtained to progress from the current iterate to the next iterate. As the chosen vector optimization problem differed across the iterations, the proposed Newton method for set optimization problems is not a straight extension of that for vector optimization problems. A step-wise algorithm of the entire process is provided. The well-definedness and convergence of the proposed method are analysed. To establish the convergence of the proposed algorithm under some regularity condition of the stationary points, we derive three key relations: a condition of nonstationarity, the boundedness of the norm of Newton direction, and the existence of a step length that satisfies the Armijo condition. We obtain the local superlinear convergence of the proposed method under uniform continuity of the Hessian and local quadratic convergence under Lipschitz continuity of the Hessian. We provide examples to illustrate the performance of the proposed method. The performance of the proposed method is also compared with that of the existing steepest-descent method.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Anshika, Ghosh, D., Ansari, Q. H., & Zhao, X. (2026). Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions. Optimization methods & software, 1–46. https://doi.org/10.1080/10556788.2026.2710699

MLA 9

Anshika, et al. “Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions.” Optimization methods & software, 2026, pp. 1–46. https://doi.org/10.1080/10556788.2026.2710699.

Chicago

Anshika, Debdas Ghosh, Qamrul Hasan Ansari, and Xiaopeng Zhao. 2026. “Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions.” Optimization methods & software: 1–46. https://doi.org/10.1080/10556788.2026.2710699.

Harvard

Anshika et al. (2026) ‘Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions’, Optimization methods & software, pp. 1–46. doi:10.1080/10556788.2026.2710699.

IEEE

Anshika, D. Ghosh, Q. H. Ansari, and X. Zhao, “Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions,” Optimization methods & software, pp. 1–46, 2026, doi: 10.1080/10556788.2026.2710699.

BibTeX

@article{anshika2026newton,
  title     = {{Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions}},
  author    = {Anshika and Ghosh, Debdas and Ansari, Qamrul Hasan and Zhao, Xiaopeng},
  journal   = {Optimization methods \& software},
  year      = {2026},
  pages     = {1--46},
  doi       = {10.1080/10556788.2026.2710699},
  url       = {https://doi.org/10.1080/10556788.2026.2710699}
}

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

  • set optimization
  • Newton's method
  • multi-objective optimization
  • necessary optimality conditions
  • local superlinear convergence
  • local quadratic convergence

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Anshika, Ghosh, D., Ansari, Q. H., & Zhao, X. (2026). Newton method for set optimization problems with set-valued mapping of finitely many vector-valued functions. Optimization methods & software, 1–46. https://doi.org/10.1080/10556788.2026.2710699

How many times has this paper been cited?

6 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?

Yes. It is open access: read the free full text at arXiv (Cornell University).

Who wrote this paper?

Anshika, Debdas Ghosh, Qamrul Hasan Ansari, Xiaopeng Zhao.

What is the DOI of this paper?

10.1080/10556788.2026.2710699. The permanent link is https://doi.org/10.1080/10556788.2026.2710699.

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.