Related papers: Projecting onto intersections of halfspaces and hy…
The goal of this paper is to construct the Hilbert scheme of complete intersections in the biprojective space $X=\mathbb{P}^m\times\mathbb{P}^n$ and for this, we define a partial order on the bidegrees of the bihomogeneous forms. As a…
We study the well-known methods of alternating and simultaneous projections when applied to two nonorthogonal linear subspaces of a real Euclidean space. Assuming that both of the methods have a common starting point chosen from either one…
We study complements of hypersurfaces in schemes with respect to the property being affine.
We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…
We provide a direct proof of a result regarding the asymptotic behavior of alternating nearest point projections onto two closed and convex sets in a Hilbert space. Our arguments are based on nonexpansive mapping theory.
We provide new conditions under which the alternating projection sequence converges in norm for the convex feasibility problem where a linear subspace with finite codimension $N\geq 2$ and a lattice cone in a Hilbert space are considered.…
We study the alternating algorithm for the computation of the metric projection onto the closed sum of two closed subspaces in uniformly convex and uniformly smooth Banach spaces. For Banach spaces which are convex and smooth of power type,…
This paper is the first in a series. The main goal of the series is to present a geometric construction of certain remarkable tensor categories arising from quantum groups coresponding to the value of deformation parameter $q$ equal to a…
Convergence of a projected stochastic gradient algorithm is demonstrated for convex objective functionals with convex constraint sets in Hilbert spaces. In the convex case, the sequence of iterates ${u_n}$ converges weakly to a point in the…
We describe a new relation between the topology of hypersurface complements, Milnor fibers and degree of gradient mappings. In particular we show that any projective hypersurface has affine parts which are bouquets of spheres. The main…
The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of higher dimensionality. In such scenarios, the exact depth is…
What is the optimal way to deform a projective hypersurface into another one? In this paper we will answer this question adopting the point of view of measure theory, introducing the optimal transport problem between complex algebraic…
We prove ``half-space" intersection properties in three settings: the hemisphere, half-geodesic balls in space forms, and certain subsets of Gaussian space. For instance, any two embedded minimal hypersurfaces in the sphere must intersect…
The problem of finding a best approximation pair of two sets, which in turn generalizes the well known convex feasibility problem, has a long history that dates back to work by Cheney and Goldstein in 1959. In 2018, Aharoni, Censor, and…
We construct a class of super-reflexive complementably minimal spaces, and study uniformly convex distortions of the norm on Hilbert space by using methods of complex interpolation.
Under investigation is the problem of finding the best approximation of a function in a Hilbert space subject to convex constraints and prescribed nonlinear transformations. We show that in many instances these prescriptions can be…
In view of the great performance of circumcentered isometry methods for solving the best approximation problem, in this work we further investigate the locally proper circumcenter mapping and circumcentered method. Various examples of…
The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they have a computational advantage over some alternatives and that this makes them successful in real-world applications.…
We study some density results for integral points on the complement of a closed subvariety in the $n$-dimensional projective space over a number field. For instance, we consider a subvariety whose components consist of $n-1$ hyperplanes…
We consider a special class of nonconvex semidefinite programming problems and show that every point satisfying the Karush--Kuhn--Tucker (KKT) conditions is globally optimal despite nonconvexity. This property is related to pseudoconvex…