On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds (Q1697905): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s40305-016-0146-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2570994762 / rank | |||
Normal rank | |||
Revision as of 21:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds |
scientific article |
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
