Related papers: Block Stanley decompositions I. Elementary and gno…

We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order…

It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…

We consider the decomposition of bounded linear operators on Hilbert spaces in terms of functions forming frames. Similar to the singular-value decomposition, the resulting frame decompositions encode information on the structure and…

This work is concerned with the optimization of nonconvex, nonsmooth composite optimization problems, whose objective is a composition of a nonlinear mapping and a nonsmooth nonconvex function, that can be written as an infimal convolution…

In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…

A Koopman decomposition is a powerful method of analysis for fluid flows leading to an apparently linear description of nonlinear dynamics in which the flow is expressed as a superposition of fixed spatial structures with exponential time…

We investigate high-order finite difference schemes for the Hamilton-Jacobi equation continuum limit of nondominated sorting. Nondominated sorting is an algorithm for sorting points in Euclidean space into layers by repeatedly removing…

In this paper we propose a new Koopman operator approach to the decomposition of nonlinear dynamical systems using Koopman Gramians. We introduce the notion of an input-Koopman operator, and show how input-Koopman operators can be used to…

We show that the stable module $\infty$-category of a finite group $G$ decomposes in three different ways as a limit of the stable module $\infty$-categories of certain subgroups of $G$. Analogously to Dwyer's terminology for homology…

Estimation of a dynamical system's latent state subject to sensor noise and model inaccuracies remains a critical yet difficult problem in robotics. While Kalman filters provide the optimal solution in the least squared sense for linear and…

Given $U$ an $n\times m$ matrix of rank $n$ and $V$ block of columns inside $U$, we consider the problem of extracting a block of columns of rank $n$ which minimize the Hilbert-Schmidt norm of the inverse while preserving the block $V$.…

The spectrum of the evolution Operator associated with a nonlinear stochastic flow with additive noise is evaluated by diagonalization in a polynomial basis. The method works for arbitrary noise strength. In the weak noise limit we…

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…

In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first establish that a class of special rank minimization problems has closed-form solutions. Using this result,…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Contraction theory is a recently developed dynamic analysis and nonlinear control system design tool based on an exact differential analysis of convergence. This paper extends contraction theory to local and global stability analysis of…

In this paper, a new general decomposition theory inspired from modular graph decomposition is presented. Our main result shows that, within this general theory, most of the nice algorithmic tools developed for modular decomposition are…

We develop an invariant deformation theory, in a form accessible to practice, for affine schemes $W$ equipped with an action of a reductive algebraic group $G$. Given the defining equations of a $G$-invariant subscheme $X \subset W$, we…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…