Answers are grounded in this paper and cite their sources.
We study differentiable strongly quasiconvex functions for providing new properties for algorithmic and monotonicity purposes. Furthermore, we provide insights into the decreasing behaviour of strongly quasiconvex functions, applying this for establishing exponential convergence for first- and second-order gradient systems without relying on the usual Lipschitz continuity assumption on the gradient of the function. The explicit discretization of the first-order dynamical system leads to the gradient descent method while discretization of the second-order dynamical system with viscous damping recovers the heavy ball method. We establish the linear convergence of both methods under suitable conditions on the parameters as well as numerical experiments for supporting our theoretical findings.
No takes yet. Share an insight, caveat, or question.
Lara et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: