1 April 2002 in Optimization
In this paper we consider the minimization problem with constraints. We will show that if the set of constraints is a Riemannian manifold of nonpositive sectional curvature, and the objective function is convex in this manifold, then the proximal point method in Euclidean space is naturally extended to solve that class of problems. We will prove that the sequence generated by our method is well defined and converge to a minimizer point. In particular we show how tools of Riemannian geometry, more specifically the convex analysis in Riemannian manifolds, can be used to solve nonconvex constrained problem in Euclidean, space.
12 November 2015 in Optimization Letters
11 January 2016 in Journal of Optimization Theory and Applications
20 February 2015 in Journal of Global Optimization
5 September 2013 in Journal of Optimization Theory and Applications
30 September 2015 in Journal of Global Optimization