Proximal Point Algorithm On Riemannian Manifolds (Q4548043)
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 1786753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proximal Point Algorithm On Riemannian Manifolds |
scientific article; zbMATH DE number 1786753 |
Statements
Proximal Point Algorithm On Riemannian Manifolds (English)
0 references
2 July 2003
0 references
minimization problem with constraints
0 references
proximal point method
0 references
Riemannian manifold
0 references
nonconvex constrained problems
0 references
0.93392116
0 references
0.9297117
0 references
0.9285642
0 references
0.9240818
0 references
0 references
0 references
0.91494024
0 references
0.91417813
0 references
0.91152537
0 references
0.91091776
0 references
The paper refers to a minimization problem with constraints. The proximal point method in the Euclidean space is naturally extended to solve the class of programs whose constraints determine a Riemannian manifold with nonpositive sectional curvature and whose objective function is convex on this manifold. The authors prove the convergence of the proximal point algorithm and show that convex analysis on Riemannian manifolds can be convenient for some nonconvex constrained problems in Euclidean sense.
0 references