Please use this identifier to cite or link to this item: https://dspace.univ-adrar.edu.dz/jspui/handle/123456789/5131
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBAHRAOUI, Fatiha-
dc.contributor.authorDEBAGHE, Mohammed / Promoteur-
dc.date.accessioned2021-04-11T10:37:53Z-
dc.date.available2021-04-11T10:37:53Z-
dc.date.issued2020-12-15-
dc.identifier.urihttps://dspace.univ-adrar.edu.dz/jspui/handle/123456789/5131-
dc.description.abstractالهدف من هذه المذكرة هو دراسة شروط وجود الحلول الدنيا لمشاكل التصغير العامه المتعلقة بالدوال المحدبة شبه المستمرة من الأسفل، باستخدام مفاهيم و خصائص الدوال المرافقة و الإزدواجية و حساب التفاضل الفرعي.en_US
dc.description.abstractL'objectif de ce mémoire est d'étudier de conditions d'existence des solutions minimales pour des problèmes généraux de minimisation liés à les fonctions convexes semi-continue inférieure, en utilisant les concepts et propriétés des fonctions conjuguées et dualité et le calcul sous-différentiel.
dc.description.abstractThe aim of this memoir is to study the conditions of existence of minimal solutions for general minimization problems related to lower semi-continuous convex functions, using the concepts and properties of conjugate functions and duality and sub-differential calculus.
dc.publisherUNIVERSITE AHMED DRAIA- ADRARen_US
dc.subjectالحد الأدنىen_US
dc.subjectالتفاضل الفرعيen_US
dc.subjectالإزدواجيةen_US
dc.subjectالدوال المرافقةen_US
dc.subjectالدوال المحدبةen_US
dc.subjectMinimumen_US
dc.subjectSous-différentielen_US
dc.subjectDualitéen_US
dc.subjectFonctions conjuguéesen_US
dc.subjectFonctions convexesen_US
dc.subjectMinimalen_US
dc.subjectSub-differentialen_US
dc.subjectDualityen_US
dc.subjectConjugate functionsen_US
dc.subjectConvex functionsen_US
dc.titleEtude des problèmes de minimisation convexes à contribution de la dualitéen_US
dc.typeThesisen_US
Appears in Collections:Mémoires de Master

Files in This Item:
File Description SizeFormat 
archivetempmemoiregener.pdf3.47 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.