Steepest descent curves of convex functions on surfaces of constant curvature

被引:0
|
作者
C. Giannotti
A. Spiro
机构
[1] Via Madonna delle Carceri,Dipartimento di Matematica e Informatica
来源
关键词
Convex Hull; Convex Subset; Constant Curvature; Euclidean Plane; Support Line;
D O I
暂无
中图分类号
学科分类号
摘要
Let S be a complete surface of constant curvature K = ±1, i.e., S2 or л2, and Ω ⊂ S a bounded convex subset. If S = S2, assume also diameter(Ω) < π/2. It is proved that the length of any steepest descent curve of a quasi-convex function in Ω is less than or equal to the perimeter of Ω. This upper bound is actually proved for the class of G-curves, a family of curves that naturally includes all steepest descent curves. In case S = S2, the existence of G-curves, whose length is equal to the perimeter of their convex hull, is also proved, showing that the above estimate is indeed optimal. The results generalize theorems by Manselli and Pucci on steepest descent curves in the Euclidean plane.
引用
收藏
页码:279 / 306
页数:27
相关论文
共 50 条
  • [21] Steepest descent method on a Riemannian manifold: the convex case
    Munier, Julien
    BALKAN JOURNAL OF GEOMETRY AND ITS APPLICATIONS, 2007, 12 (02): : 98 - 106
  • [22] A hybrid steepest descent method for constrained convex optimization
    Gerard, Mathieu
    De Schutter, Bart
    Verhaegen, Michel
    AUTOMATICA, 2009, 45 (02) : 525 - 531
  • [23] Level curves of constant mean curvature graphs over convex domains
    Lopez, Rafael
    JOURNAL OF DIFFERENTIAL EQUATIONS, 2013, 254 (07) : 3081 - 3087
  • [24] Surfaces of constant mean curvature bounded by two planar curves
    Lopez, R
    ANNALS OF GLOBAL ANALYSIS AND GEOMETRY, 1997, 15 (03) : 201 - 210
  • [25] Surfaces of Constant Mean Curvature Bounded by Two Planar Curves
    Rafael López
    Annals of Global Analysis and Geometry, 1997, 15 : 201 - 210
  • [26] Nonlinear steepest descent approach to orthogonality on elliptic curves
    Bertola, M.
    JOURNAL OF APPROXIMATION THEORY, 2022, 276
  • [27] A generalization of the steepest descent method for matrix functions
    Institut für Numerische Mathematik und Optimierung, Technische Universität Bergakademie Freiberg, D-09596 Freiberg, Germany
    Electron. Trans. Numer. Anal., 2007, (206-222):
  • [28] A GENERALIZATION OF THE STEEPEST DESCENT METHOD FOR MATRIX FUNCTIONS
    Afanasjew, M.
    Eiermann, M.
    Ernst, O. G.
    Guettel, S.
    ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2007, 28 : 206 - 222
  • [29] Stability of steepest descent with momentum for quadratic functions
    Torii, M
    Hagan, MT
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2002, 13 (03): : 752 - 756
  • [30] Global convergence of steepest descent for quadratic functions
    Zeng, ZG
    Huang, DS
    Wang, ZF
    INTELLIGENT DAA ENGINEERING AND AUTOMATED LEARNING IDEAL 2004, PROCEEDINGS, 2004, 3177 : 672 - 677