Related papers: On angles, projections and iterations
This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated…
The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application to many…
Here we explore the geometry of the osculating spaces to projective varieties of arbitrary dimension. In particular, we classify varieties having very degenerate higher order osculating spaces and we determine mild conditions for the…
It is pointed out that if we allow for the possibility of a multilayered universe, it is possible to maintain exact supersymmetry and arrange, in principle, for the vanishing of the cosmological constant. Superpartner(s) of a known particle…
We discuss representations of the projective line over a ring $R$ with 1 in a projective space over some (not necessarily commutative) field $K$. Such a representation is based upon a $(K,R)$-bimodule $U$. The points of the projective line…
For real projective spaces, (a) the Euclidean immersion dimension, (b) the existence of axial maps, and (c) the topological complexity are known to be three facets of the same problem. But when it comes to embedding dimension, the classical…
Interdependencies between experimental spectra, representing line or plane projections of electronic densities, are derived from their consistency and symmetry conditions. Some additional relations for plane projections are obtained by…
In this paper, we proposed an alternating projection based algorithm to solve a class of distributed MIN-MAX convex optimization problems. We firstly transform this MINMAX problem into the problem of searching for the minimum distance…
In this article we characterize the extreme points of the unit ball of a non-commutative (quantum) Lorentz space associated with a semi-finite von Neumann algebra. This enables us to show that surjective isometries between non-commutative…
The note describes the cones in the Euclidean space admitting isotonic metric projection with respect to the coordinate-wise ordering. As a consequence it is showed that the metric projection onto the regression cone (the cone defined by…
We investigate P. Halmos' two projections theorem, (or two subspaces theorem) in the context of a synaptic algebra (a generalization of the self-adjoint part of a von Neumann algebra).
We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.
The initial techniques developed in Euclid's Elements, well before the use of the parallel postulate, are reexamined in order to clarify even the most obscure details, particularly those related to equality, superposition and angle…
According to the von Neumann-Halperin and Lapidus theorems, in a Hilbert space the iterates of products or, respectively, of convex combinations of orthoprojections are strongly convergent. We extend these results to the iterates of convex…
We establish new and different kinds of proofs of properties that arise due to the orthogonal decomposition of the Hilbert space, including projections, over the unit interval of one dimension. We also see angles between functions,…
We show how the symmetry of attractors of equivariant dynamical systems can be observed by equivariant projections of the phase space. Equivariant projections have long been used, but they can give misleading results if used improperly and…
In these notes we aim at bringing together design theory and projective geometry over a ring. Both disciplines are well established, but the results on the interaction between them seem to be rare and scattered over the literature. Thus our…
This article provides a new perspective on the geometry of a projective line, which helps clarify and illuminate some classical results about projective plane. As part of the same train of ideas, the article also provides a proof of the…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…