Related papers: Computing Kurdyka-\L{}ojasiewicz exponents via com…

The only known constructive factorization algorithm for linear partial differential operators (LPDOs) is Beals-Kartashova (BK) factorization \cite{bk2005}. One of the most interesting features of BK-factorization: at the beginning all the…

We study some aspects of the theory of non-commutative differential calculi over complex algebras, especially over the Hopf algebras associated to compact quantum groups in the sense of S.L. Woronowicz. Our principal emphasis is on the…

In this article, we analyse the Kantorovich type exponential sampling operators and its linear combination. We derive the Voronovskaya type theorem and its quantitative estimates for these operators in terms of an appropriate K-functional.…

Let $X\subset \mathbb{R}^n$ be a compact semialgebraic set and let $f:X\to \mathbb{R}$ be a nonzero Nash function. We give a Solern\'o and D'Acunto-Kurdyka type estimation of the exponent $\varrho\in[0,1)$ in the {\L}ojasiewicz gradient…

Given a hypersurface singularity $(X,0) \subset (\mathbb{C}^{n+1},0)$ defined by a holomorphic function $f:(\mathbb{C}^{n+1},0) \to (\mathbb{C},0)$, we introduce an alternating version of Teissier's Jacobian Newton polygon, associated with…

The aim of this paper is to derive convergence results for projected line-search methods on the real-algebraic variety $\mathcal{M}_{\le k}$ of real $m \times n$ matrices of rank at most $k$. Such methods extend Riemannian optimization…

We consider the computation of roots of polynomials expressed in the Chebyshev basis. We extend the QR iteration presented in [Eidelman, Y., Gemignani, L., and Gohberg, I., Numer. Algorithms, 47.3 (2008): pp. 253-273] introducing an…

For a local singular plane curve germ $f(X,Y)=0$ we characterize all nonsingular $\lambda\in\bbC\{X,Y\}$ such that the {\L}ojasiewicz exponent of $\grad\,f$ is not attained on the polar curve $\bJ(\lambda,f)=0$. When $f$ is not Morse we…

We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…

Motivated by connections between algebraic complexity lower bounds and tensor decompositions, we investigate Koszul-Young flattenings, which are the main ingredient in recent lower bounds for matrix multiplication. Based on this tool we…

The purpose of this paper is to extend the full convergence results of the classic GLL-type (Grippo-Lampariello-Lucidi) nonmonotone methods to nonconvex and nonsmooth optimization. We propose a novel iterative framework for the minimization…

Given a reproducing kernel $k$ on a nonempty set $X$, we define the reproductive boundary of $X$ with respect to $k$. Furthermore, we generalize the well known nontangential and horocyclic approach regions of the unit circle to this new…

In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…

Minimization of a smooth function on a sphere or, more generally, on a smooth manifold, is the simplest non-convex optimization problem. It has a lot of applications. Our goal is to propose a version of the gradient projection algorithm for…

We construct special solutions to the rational quantum Knizhnik-Zamolodchikov equation associated with the Lie algebra $gl_N$. The main ingredient is a special class of the shifted non-symmetric Jack polynomials. It may be regarded as a…

This paper proposes a novel preconditioned implicit-explicit algorithm enhanced with the extrapolation technique for non-convex optimization problems. The algorithm employs a third-order Adams-Bashforth scheme for the nonlinear and explicit…

We present a quick approach to computing the $K$-theory of the category of locally compact modules over any order in a semisimple $\mathbb{Q}$-algebra. We obtain the $K$-theory by first quotienting out the compact modules and subsequently…

The Polyak-{\L}ojasiewicz (P{\L}) condition is often invoked in nonconvex optimization because it allows fast convergence of algorithms beyond strong convexity. A function $f \colon \mathcal{M} \to \mathbb{R}$ on a Riemannian manifold…

Differential equations posed on quadratic matrix Lie groups arise in the context of classical mechanics and quantum dynamical systems. Lie group numerical integrators preserve the constants of motions defining the Lie group. Thus, they…

The aim of this survey is to present the main important techniques and tools from variational analysis used for first and second order dynamical systems of implicit type for solving monotone inclusions and non-smooth optimization problems.…