EUVIMEDEUVIMED entdecken
Crossref

Global descent method for non-convex multi-objective optimization problems

Bikram Adhikary, Md Abu Talhamainuddin Ansary, Savin Treanţă

Numerical Algorithms · 01.06.2026

DOI: 10.1007/s11075-026-02396-7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Algorithms, online erschienen am 01.06.2026. Verfasst von Bikram Adhikary und 2 weiteren Autor:innen. Die Arbeit nennt 36 Literaturangaben. Gefördert von: Prime Minister’s Research Fellowship.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, we develop a global descent method for non-convex multi-objective optimization problems. The proposed approach builds upon foundational concepts from single-objective global descent techniques while removing the need for predefined scalars or ordering information of objective functions. Initially, the proposed method identifies a local weak efficient solution using any suitable descent algorithm, then applies an auxiliary function termed the multi-objective global descent function to systematically transition toward improved local weak efficient solutions. It is justified that this method can generate a global Pareto front for non-convex problems, which has many different local Pareto fronts. Finally, comprehensive numerical experiments on benchmark non-convex multi-objective optimization problems have been done to demonstrate the method's robustness, scalability and effectiveness of the proposed method.

Förderung

  • Prime Minister’s Research Fellowship

Zitieren

APA

Adhikary, B., Ansary, M. A. T., & Treanţă, S. (2026). Global descent method for non-convex multi-objective optimization problems. Numerical Algorithms. https://doi.org/10.1007/s11075-026-02396-7

Vancouver

Adhikary B, Ansary MAT, Treanţă S. Global descent method for non-convex multi-objective optimization problems. Numerical Algorithms. 2026. doi:10.1007/s11075-026-02396-7

BibTeX
@article{Adhikary2026,
  author = {Adhikary, Bikram and Ansary, Md Abu Talhamainuddin and Treanţă, Savin},
  title = {Global descent method for non-convex multi-objective optimization problems},
  journal = {Numerical Algorithms},
  year = {2026},
  doi = {10.1007/s11075-026-02396-7}
}
Kostenlos starten →