On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds (Q1697905)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6841404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds |
scientific article; zbMATH DE number 6841404 |
Statements
On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds (English)
0 references
20 February 2018
0 references
The authors propose a so-called inexact proximal point algorithm by extending previous methods for multiobjective optimization problems with geodesic convex functions. They also study the convergence of the points generated by the algorithm and establish conditions guaranteeing convergence to Pareto critical and Pareto optimal points.
0 references
inexact proximal point algorithm
0 references
rate of convergence
0 references
Pareto critical point
0 references
Pareto optimality
0 references
0 references
0 references
0 references
0 references
0 references
0.8950335383415222
0 references
0.8949876427650452
0 references
0.887658953666687
0 references
0.8752378225326538
0 references
