Related papers: Computing Kurdyka-\L{}ojasiewicz exponents via com…
In view of the minimization of a function which is the sum of a differentiable function $f$ and a convex function $g$ we introduce descent methods which can be viewed as produced by inexact auxiliary problem principleor inexact variable…
In this paper, we study the local variational geometry of the optimal solution set of the trust region subproblem (TRS), which minimizes a general, possibly nonconvex, quadratic function over the unit ball. Specifically, we demonstrate that…
We give a classification of unitary representations of certain Polish, not necessarily locally compact, groups: the groups of all measurable functions with values in the circle and the groups of all continuous functions on compact, second…
We study the convergence of general abstract descent methods applied to a lower semicontinuous nonconvex function f that satisfies the Kurdyka-Lojasiewicz inequality in a Hilbert space. We prove that any precompact sequence converges to a…
In this paper, we study the order of approximation for max-product Kantorovich sampling operators based upon generalized kernels in the setting of Orlicz spaces. We establish a quantitative estimate for the considered family of…
We show how the Lie group analysis method can be used in order to obtain first integrals of any system of ordinary differential equations. The method of reduction/increase of order developed by Nucci (J. Math. Phys. 37, 1772-1775 (1996)) is…
Competitive equilibrium (CE) for chores has recently attracted significant attention, with many algorithms proposed to approximately compute it. However, existing algorithms either lack iterate convergence guarantees to an exact CE or…
In this paper, a geometric resolution of singularities algorithm is developed. This method is elementary in its statement and proof, using explicit coordinate systems as much as possible. Each coordinate change used in the resolution…
We give an expression for the {\L}ojasiewicz exponent of a wide class of n-tuples of ideals $(I_1,..., I_n)$ in $\O_n$ using the information given by a fixed Newton filtration. In order to obtain this expression we consider a reformulation…
In this paper, we explain in more details the modern treatment of the problem of group classification of (systems of) partial differential equations (PDEs) from the algorithmic point of view. More precisely, we revise the classical…
The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…
The iteratively reweighted l1 algorithm is a widely used method for solving various regularization problems, which generally minimize a differentiable loss function combined with a nonconvex regularizer to induce sparsity in the solution.…
We suggest a new algorithm to estimate representations of compact Lie groups from finite samples of their orbits. Different from other reported techniques, our method allows the retrieval of the precise representation type as a direct sum…
Let $f$ be an isolated singularity at the origin of $\mathbb{C}^n$. One of many invariants that can be associated with $f$ is its {\L}ojasiewicz exponent $\mathcal{L}_0 (f)$, which measures, to some extent, the topology of $f$. We give, for…
We propose a novel iterative framework for minimizing a proper lower semicontinuous Kurdyka-{\L}ojasiewicz (KL) function $\Phi$. It comprises a Zhang-Hager (ZH-type) nonmonotone decrease condition and a relative error condition. Hence, the…
We give a new proof of the absence of non-trivial idempotents in the group ring of torsion-free cocompact lattices in SL(n,C). It is based on the following procedure. We lift the class of the trace in the cyclic cohomology of the group ring…
Let $k$ be an algebraically closed field of any characteristic. We apply the Hamburger-Noether process of successive quadratic transformations to show the equivalence of two definitions of the {\L}ojasiewicz exponent…
In this paper, we study the decentralized optimization problem of minimizing a finite sum of continuously differentiable and possibly nonconvex functions over a fixed-connected undirected network. We propose a unified decentralized…
In this paper, we study stochastic constrained minimax optimization problems with nonconvex-nonconcave structure, a central problem in modern machine learning, for which reliable and efficient algorithms remain largely unexplored due to its…
This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…