On steepest descent curves for quasi convex families in $R^n$
Marco Longinetti, Paolo Manselli, Adriana Venturi

TL;DR
This paper investigates properties of steepest descent curves within quasi convex families in R^n, establishing their rectifiability, bounds on length, and their relation to quasi convex functions, with proofs of existence, uniqueness, and stability.
Contribution
It introduces generalized steepest descent curves for quasi convex functions, proving their fundamental properties and establishing bounds and stability results.
Findings
Steepest descent curves are rectifiable with bounded length.
Existence, uniqueness, and stability of these curves are established.
Generalizations of steepest descent curves for quasi convex functions are introduced.
Abstract
A connected, linearly ordered path satisfying is shown to be a rectifiable curve; a priori bounds for its length are given; moreover, these paths are generalized steepest descent curves of suitable quasi convex functions. Properties of quasi convex families are considered; special curves related to quasi convex families are defined and studied; they are generalizations of steepest descent curves for quasi convex functions and satisfy the previous property. Existence, uniqueness, stability results and length's bounds are proved for them.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Optimization and Variational Analysis · Nonlinear Partial Differential Equations
