2015
DOI: 10.1007/s00526-015-0837-y
|View full text |Cite
|
Sign up to set email alerts
|

Discrete-time gradient flows and law of large numbers in Alexandrov spaces

Abstract: Abstract. We develop the theory of discrete-time gradient flows for convex functions on Alexandrov spaces with arbitrary upper or lower curvature bounds. We employ different resolvent maps in the upper and lower curvature bound cases to construct such a flow, and show its convergence to a minimizer of the potential function. We also prove a stochastic version, a generalized law of large numbers for convex function valued random variables, which not only extends Sturm's law of large numbers on nonpositively cur… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
23
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 22 publications
(23 citation statements)
references
References 41 publications
0
23
0
Order By: Relevance
“…which is called the proximal point algorithm [1,9,18], where {λ n } is a sequence of positive real numbers. The convergence of the proximal point algorithm in a metric space (e.g.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…which is called the proximal point algorithm [1,9,18], where {λ n } is a sequence of positive real numbers. The convergence of the proximal point algorithm in a metric space (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…The convergence of the proximal point algorithm in a metric space (e.g. CAT(0)-spaces and Alexandrov spaces) have been studied by several authors [1,9,18], etc.…”
Section: Introductionmentioning
confidence: 99%
“…Later a deterministic, also called "nodice", version of Sturm's law that periodically recycles all the points A i was proved by Holbrook [12] in P and then in the CAT(0) metric setting by the authors [22], and independently in [4]. This "nodice" theorem states that S n converges to Λ( k−1 i=0 1 k δ Ai ) for the recycling deterministic version Y n := A n in (2), where n denotes the residual of n modulo k. Further generalizations were proved in the CAT (1) setting by Ohta and the second author [28] and by Yokota [36]. These metric approaches treat the sequence of inductive means S n as a discrete-time approximation of the gradient flow of the cost function to be minimized in (1), and apply the Riemannian-like nature of the CAT (1) property in an essential way.…”
Section: The Contractive Barycenter Of Positive Operatorsmentioning
confidence: 98%
“…Moreover Perel'man and Petrunin [42], [43] refined the theory into semiconcave functions on Alexandrov spaces. Their studies have been succeeded to many other researches such as [13], [14], [34], [35], [36], [38], etc.…”
mentioning
confidence: 95%