<p>The object of this book is to present the basic facts of convex functions, standard dynamical systems, descent numerical algorithms and some computer programs on Riemannian manifolds in a form suitable for applied mathematicians, scientists and engineers. It contains mathematical information on t
Convex functions and optimization methods on Riemannian manifolds
β Scribed by UdriΘte, Constantin
- Publisher
- Springer; Kluwer Academic
- Year
- 2011; 1994
- Tongue
- English
- Leaves
- 365
- Series
- Mathematics and Its Applications 297
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Table of Contents
Preface. 1. Metric properties of Riemannian manifolds. 2. First and second variations of the p-energy of a curve. 3. Convex functions on Riemannian manifolds. 4. Geometric examples of convex functions. 5. Flows, convexity and energies. 6. Semidefinite Hessians and applications. 7. Minimization of functions on Riemannian manifolds. Appendices: 1. Riemannian convexity of functions f:R-->
R. 2. Descent methods on the Poincare plane. 3. Descent methods on the sphere. 4. Completeness and convexity on Finsler manifolds. Bibliography. Index.
β¦ Subjects
Convex functions;Mathematical optimization;Riemannian manifolds
π SIMILAR VOLUMES
<p>This monograph is based on the author's results on the Riemannian geΒ ometry of foliations with nonnegative mixed curvature and on the geometry of sub manifolds with generators (rulings) in a Riemannian space of nonnegative curvature. The main idea is that such foliated (sub) manifolds can be dec
This monograph is based on the author's results on the Riemannian geΒ ometry of foliations with nonnegative mixed curvature and on the geometry of sub manifolds with generators (rulings) in a Riemannian space of nonnegative curvature. The main idea is that such foliated (sub) manifolds can be decomΒ
<p><span>Manifold optimization is an emerging field of contemporary optimization that constructs efficient and robust algorithms by exploiting the specific geometrical structure of the search space. In our case the search space takes the form of a manifold. </span></p><p><span>Manifold optimization
<p>A first approximation to the idea of a foliation is a dynamical system, and the resulting decomposition of a domain by its trajectories. This is an idea that dates back to the beginning of the theory of differential equations, i.e. the seventeenth century. Towards the end of the nineteenth centur