Um algoritmo proximal com quase-distância
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Rā whakaputa: | 2015 |
| Hōputu: | Master thesis |
| Reo: | por |
| Puna: | Repositório Institucional da UFG |
| Download full: | http://repositorio.bc.ufg.br/tede/handle/tede/4521 |
Whakarāpopototanga: | In this work, based in [1, 18], we study the convergence of method of proximal point (MPP) regularized by a quasi-distance, applied to an optimization problem. The objective function considered not is necessarily convex and satisfies the property of Kurdyka- Lojasiewicz around by their generalized critical points. More specifically, we will show that any limited sequence, generated from MPP, converge the a generalized critical point. |
Me noho koe te mea tuatahi ki te waiho tākupu!