EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Wolfe-type steepest descent algorithm for uncertain quadratic multiobjective optimization problems

Shubham Kumar, Amar Deep

Boletim da Sociedade Paranaense de Matemática · 10.04.2026 · 44 (7) · 1-13

DOI: 10.5269/bspm.81660 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 10.04.2026. Verfasst von Shubham Kumar und 1 weiteren Autor:innen. Die Arbeit nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This work develops a Wolfe-type steepest descent algorithm for solving uncertain quadratic multiobjective optimization problems (UQMOPs) by reformulating them into deterministic robust counterparts via objective-wise worst-case criteria. The proposed method incorporates a Wolfe-type inexact line search to obtain more efficient descent directions and improve overall convergence behavior. A Zoutendijk-type condition is established to guarantee linear convergence under standard assumptions.

Zitieren

APA

Kumar, S., & Deep, A. (2026). A Wolfe-type steepest descent algorithm for uncertain quadratic multiobjective optimization problems. Boletim da Sociedade Paranaense de Matemática, 44(7), 1-13. https://doi.org/10.5269/bspm.81660

Vancouver

Kumar S, Deep A. A Wolfe-type steepest descent algorithm for uncertain quadratic multiobjective optimization problems. Boletim da Sociedade Paranaense de Matemática. 2026;44(7):1-13. doi:10.5269/bspm.81660

BibTeX
@article{Kumar2026,
  author = {Kumar, Shubham and Deep, Amar},
  title = {A Wolfe-type steepest descent algorithm for uncertain quadratic multiobjective optimization problems},
  journal = {Boletim da Sociedade Paranaense de Matemática},
  year = {2026},
  volume = {44},
  number = {7},
  pages = {1--13},
  doi = {10.5269/bspm.81660}
}
Kostenlos starten →