Inexact Proximal Point Algorithm for Multiobjective Optimization
AbstractThe main aim of this article is to present an inexact proximal point algorithm for constrained multiobjective optimization problems under the locally Lipschitz condition of the cost function. Convergence analysis of the considered method, Fritz-John necessary optimality condition of $\epsilon$-quasi weakly Pareto solution in terms of Clarke subdifferential is derived. The suitable conditions to guarantee that the accumulation points of the generated sequences are Pareto-Clarke critical points are provided.
How to Cite
License Terms has to be written!