Inexact Proximal Point Algorithm for Multiobjective Optimization

Authors

  • F. Amir Department of Mathematics, Faculty of Science, Naresuan University, Phitsanulok 65000, Thailand
  • N. Petrot Department of Mathematics, Faculty of Science, Naresuan University, Phitsanulok 65000, Thailand

Abstract

The 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.

Downloads

Published

2020-04-06

How to Cite

Amir, F., & Petrot, N. (2020). Inexact Proximal Point Algorithm for Multiobjective Optimization. Journal of Nonlinear Analysis and Optimization: Theory & Applications, 11(1), 59-71. Retrieved from http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/575

Issue

Section

Research Article