The main objective of this thesis is to propose an algorithm for finding the Pareto points of a convex multi-objective optimization problem, in which the objective functions are not necessarily smooth. To this end, we will first study convex sets an‎d functions. Then, we will introduce the concept of subdifferential for convex functions an‎d examine its most important properties. Finally, a descent iterative algorithm will be presented to find the Pareto points of a convex multi-objective optimization problem, an‎d its convergence analysis will be investigated.

مرتضي ملك نيا

مهدي نعمتي , رسول عاشقي حسين آبادي