Search arXivSearch

arXiv · 2604.05372

From Nonsmooth Minima to Smooth Branches via Heat Kernel Regularization

Abstract

Many optimization problems in science and engineering involve objective functions that are nonsmooth at their minimizers. A common strategy is to trace a branch of minimizers of a regularized objective as the smoothing scale tends to zero; however, for nonsmooth functions, it is generally unclear whether such a branch can be continued and whether the associated continuation equation remains locally solvable. We study heat-kernel regularization and the resulting continuation equation along a local minimizing branch connected to a minimizer of the original objective. Under a global growth condition and a local leading-order description of the form $|x|^a$ with $1 \le a \le 2$, we first show that the regularized objective admits global minimizers and that any such minimizing branch localizes at the natural heat scale $O(\sqrt{t})$. We then prove that the asymptotic behavior of the regularized Hessian is determined by the local profile of the original objective: it remains uniformly positive definite in the quadratic case $a=2$, while in the subquadratic regime $1 \le a < 2$ its smallest eigenvalue grows at the controlled rate $t^{(a-2)/2}$. Consequently, the regularized Hessian remains asymptotically nondegenerate for all sufficiently small $t>0$, and the continuation equation remains locally solvable, even when the original objective does not admit a classical Hessian at the minimizer. Our results provide a rigorous second-order framework for continuation-based analysis in nonsmooth optimization by showing how heat regularization restores nondegeneracy near singular minimizers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hyeontae Jo. 2026-04-07. From Nonsmooth Minima to Smooth Branches via Heat Kernel Regularization. https://arxiv.org/abs/2604.05372

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