ojasiewicz-type inequalities with explicit exponents for the largest eigenvalue function of real symmetric polynomial matrices
Abstract
Let F(x) := (fij(x))i,j=1,…,p, be a real symmetric polynomial matrix of order p and let f(x) be the largest eigenvalue function of the matrix F(x). We denote by ∂ f(x) the Clarke subdifferential of f at x. In this paper, we first give the following nonsmooth version of ojasiewicz gradient inequality for the function f with an explicit exponent: For any x∈ Rn there exist c > 0 and ε > 0 such that we have for all \|x - x\| < ε, equation* ∈f \ \| w \| \ : \ w ∈ ∂ f(x) \ \ \ c\, |f(x) - f( x)|1 - 1R(2n+p(n+1),d+3), equation* where d:=i,j = 1, …, p fi j and R is a function introduced by D'Acunto and Kurdyka: R(n, d) := d(3d - 3)n-1 if d 2 and R(n, d) := 1 if d = 1. Then we establish error bounds with explicitly determined exponents, local and global, for the largest eigenvalue function f(x) of the matrix F(x).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.