Geodesic convexity

Known as: Geodesic convex, Geodesically convex 
In mathematics — specifically, in Riemannian geometry — geodesic convexity is a natural generalization of convexity for sets and functions to… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Geodesic convexity generalizes the notion of (vector space) convexity to nonlinear metric spaces. But unlike convex optimization… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2012
2012
  • Ami Wiesel
  • IEEE Transactions on Signal Processing
  • 2012
Geodesic convexity is a generalization of classical convexity which guarantees that all local minima of g-convex functions are… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
2012
2012
We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic… (More)
Is this relevant?
2011
2011
We consider finite-dimensional, time-continuous Markov chains satisfying the detailed balance condition as gradient systems with… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In medical imaging, parameterized 3-D surface models are useful for anatomical modeling and visualization, statistical… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2004
2004
In this work we investigate the behavior of various geodesic convexity parameters with respect to the Cartesian product operation… (More)
Is this relevant?
1999
1999
Consider a closed subset of a complete Riemannian manifold, such that all geodesics with end-points in the subset are contained… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1998
1998
Consider a closed subset of a Riemannian manifold, such that all geodesics with end-points in the subset are contained in the… (More)
Is this relevant?
1994
1994
A pebbled graph is called “(geodesically) convex” if at least one shortest path between any two unpebbled nodes has no pebbles on… (More)
Is this relevant?
1987
1987
A graph G is bridged if each cycle C of length at least four contains two vertices whose distance from each other in G is… (More)
  • figure 1
  • figure 2
Is this relevant?