Inexact Proximal Point Method Using Quasi-Distances for Optimization of KL Functions
DOI:
https://doi.org/10.15381/pesquimat.v25i1.23144Keywords:
Kurdyka-Lojasiewicz inequality, quasi-distances, proximal point algo-rithmAbstract
An inexact proximal point algorithm using quasi-distances is introduced to give a solution of a minimization problem in the Euclidean space. This algorithm has been motivated by the proximal method introduced by Attouch, Bolte and Svaiter [1] but in this case we consider quasi-distance instead of the Euclidean distance, functions satisfying the Kurdyka-Lojasewicz inequality, vector errors in the critical point of the proximal subproblems. We obtain, under some additional assumptions, the global convergence of the sequence generated by the algorithm to a critical point of the problem.
Downloads
Published
Issue
Section
License
Copyright (c) 2022 Erik A. Papa Quiroz, Jose L. Huaman ˜Naupa
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
THE AUTHORS RETAIN THEIR RIGHTS:
a) The authors retain their trademark and patent rights, and also on any process or procedure described in the article.
b) The authors retain the right to share, copy, distribute, execute and publicly communicate the article published in Pesquimat magazine (for example, place it in an institutional repository or publish it in a book), with recognition of its initial publication in the Pesquimat magazine.
c) The authors retain the right to make a later publication of their work, to use the article or any part of it (for example: a compilation of their works, notes for conferences, thesis, or for a book), provided that they indicate the source of publication (authors of the work, magazine, volume, number and date).