Programmation Convexe

Abstract

حالة optimisation sous contraintes قدمنا في هذا العمل الطرق الأكثر استعمالا لحل مسائل خاصي التحةد مممة فةي إثبةا وجةد وحدانية حةل .dualité المحدب .خاص طرق الإسقاط وطريق هذه المسائل واثبا تقار الطرق The main purpose of this paper is to provide a relatively complete description and analysis of the methods most commonly used in constrained optimization in the convex case. Particular projection methods and the method of duality. Convexity plays a very important role in the existence and uniqueness of the solution and also the convergence of these methods.