On recent descent methods for large-scale optimization

dc.contributor.authorBOURDIM , Hadil
dc.contributor.authorBOUZEGHAR , Lina Manel
dc.contributor.authorZIADI , Raouf Supervisor
dc.date.accessioned2026-06-29T11:22:18Z
dc.date.issued2026
dc.descriptionهذه الأطروحة تتناول دراسة نظرية وعددية لبعض خوارزميات التدرج المترافق لحل مسائل الأمثلة غير مقيدة، حيث تكون الدالة غير خطية ولكنها تفاضلية. لدراسة أداء الطرق المتناولة، تم إجراء تجارب عددية على مجموعة من دوال الاختبار
dc.description.abstractIn this study, we present a synthesis of various conjugate gradient methods for solving unconstrained optimization problems, where the objective function is nonlinear but continuously differentiable (and possibly non-convex). To illustrate the performance of these methods, numerical experiments are conducted on a set of standard test functions, along with comparative analysis.
dc.description.sponsorshipDans cette étude, nous présentons une synthèse de différentes méthodes de gradient conjugué pour la résolution de problèmes d'optimisation sans contraintes, où la fonction objectif est non linéaire mais continûment différentiable (et éventuellement non convexe). Afin d'illustrer les performances de ces méthodes, des expériences numériques sont menées sur un ensemble de fonctions de test standard, accompagnées d'une analyse comparative
dc.identifier.otherMAM/0841
dc.identifier.urihttps://repository.univ-setif.dz/handle/123456789/1598
dc.language.isoen
dc.publisherSetif 1 Unuversity Ferhat Abbas . Faculty of Sciences
dc.subjectUnconstrained optimization
dc.subjectNonlinear optimization
dc.subjectConjugate gradient methods
dc.subjectLine search
dc.subjectGlobal convergence.
dc.titleOn recent descent methods for large-scale optimization
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
MAM0841.pdf
Size:
531.81 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: