Search arXivSearch

arXiv · 2608.22612

Dry-Friction Inertial Dynamics with Implicit Hessian-Driven Damping: Finite-Time Stabilization, Shadowing, and Proximal Discretization

Abstract

In a real Hilbert space $\mathcal H$, we study the following inertial differential inclusion $$ \ddot x(t)+γ\dot x(t)+\partialϕ(\dot x(t)) +\nabla f(x(t)+β\dot x(t))\ni0, $$ where $γ>0$ is the viscous damping coefficient, and $ϕ$ is a convex potential with a sharp minimum at the origin that models the dry friction damping (typically $ϕ=r\Vert\cdot\Vert$ where $r>0$ is the dry-friction parameter). The function $f$ represents the smooth potential to be minimized, and the shifted-gradient evaluation $\nabla f(x(t)+β\dot x(t))$ is known as the implicit Hessian-driven model. Here $β\geq 0$ represents the corresponding Hessian-driven parameter. Both the explicit and the implicit Hessian-driven dynamics are know to attenuate the oscillations that occurs in inertial systems. Our contribution concerns the quantitative analysis of this continuous dynamic and its temporal discretization counter-part under the action of these three combined dampings: viscous damping, dry friction, and implicit Hessian-driven damping. We establish a global well-posedness, an exact Lyapunov analysis adapted to the implicit Hessian-driven damping, finite length of the trajectory and its strong convergence to an approximate critical point $x_\infty$ of $f$ satisfying: $-\nabla f(x_\infty)\in\partial ϕ(0)$. We show finite-time stabilization under a strict interior condition on the terminal force. We also compare the explicit and the implicit Hessian-driven dynamics and show that their trajectories differ by $O(β^2)$ on finite horizons. A temporal semi-implicit discretization of the dynamic above leads to a proximal implicit Hessian-driven algorithm based on one shifted-gradient evaluation. We derive its discrete Lyapunov analysis, asymptotic convergence and, under a strict terminal margin, finite convergence of the discrete iterates.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samir Adly. 2026-08-23. Dry-Friction Inertial Dynamics with Implicit Hessian-Driven Damping: Finite-Time Stabilization, Shadowing, and Proximal Discretization. https://arxiv.org/abs/2608.22612

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC