Related papers: Projection Methods for some Constrained Systems
In this note, we extend the quasi-projective dimension of finite (that is, finitely generated) modules to homologically finite complexes, and we investigate some of homological properties of this dimension.
The goal of these notes is to show that the classification problem of algebraically unbiased system of projectors has an interpretation in symplectic geometry. This leads us to a description of the moduli space of algebraically unbiased…
Bifibrations, in symplectic geometry called also dual pairs, play a relevant role in the theory of superintegrable Hamiltonian systems. We prove the existence of an analogous bifibrated geometry in dynamical systems with a symmetry group…
We consider the problem of projecting a probability measure $\pi$ on a set $\mathcal{M}\_N$ of Radon measures. The projection is defined as a solution of the following variational problem:\begin{equation*}\inf\_{\mu\in \mathcal{M}\_N}…
This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization…
This work presents a geometric formulation for transforming nonconservative mechanical Hamiltonian systems and introduces a new method for regularizing and linearizing central force dynamics -- in particular, Kepler and Manev dynamics --…
We study the geometrical properties of the utility space (the space of expected utilities over a finite set of options), which is commonly used to model the preferences of an agent in a situation of uncertainty. We focus on the case where…
We investigate the geometrical structure of probabilistic generative dimensionality reduction models using the tools of Riemannian geometry. We explicitly define a distribution over the natural metric given by the models. We provide the…
Variable projection solves structured optimization problems by completely minimizing over a subset of the variables while iterating over the remaining variables. Over the last 30 years, the technique has been widely used, with empirical and…
Learning in Riemannian orbifolds is motivated by existing machine learning algorithms that directly operate on finite combinatorial structures such as point patterns, trees, and graphs. These methods, however, lack statistical…
Shape-constrained inference has wide applicability in bioassay, medicine, economics, risk assessment, and many other fields. Although there has been a large amount of work on monotone-constrained univariate curve estimation, multivariate…
We propose and analyze a novel theoretical and algorithmic framework for structured prediction. While so far the term has referred to discrete output spaces, here we consider more general settings, such as manifolds or spaces of probability…
The recently proposed projection quantization, which is a method to quantize particular subspaces of systems with known quantum theory, is shown to yield a genuine quantization in several cases. This may be inferred from exact results…
We present a variation of quasi-isometry to approach the problem of defining a geometric notion equivalent to commensurability. In short, this variation can be summarized as "quasi-isometry with uniform parameters for a large enough family…
This paper combines two classical theories, namely metric projective differential geometry and superintegrability. We study superintegrable systems on 2-dimensional geometries that share the same geodesics, viewed as unparametrized curves.…
We consider a generalization of Riemannian geometry that naturally arises in the framework of control theory. Let $X$ and $Y$ be two smooth vector fields on a two-dimensional manifold $M$. If $X$ and $Y$ are everywhere linearly independent,…
In this article, we will introduce methods of non-standard analysis into projective geometry. Especially, we will analyze the properties of a projective space over a non-Archimedean field. Non-Archimedean fields contain numbers that are…
We introduce the concept of generalized almost plastic structure, and, on a pseudo-Riemannian manifold endowed with two $(1,1)$-tensor fields satisfying some compatibility conditions, we construct a family of generalized almost plastic…
The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…
We introduce an abstract algorithm that aims to find the Bregman projection onto a closed convex set. As an application, the asymptotic behaviour of an iterative method for finding a fixed point of a quasi Bregman nonexpansive mapping with…