Related papers: Projection process with definable right-hand side
Projection-based iterative methods for solving large over-determined linear systems are well-known for their simplicity and computational efficiency. It is also known that the correct choice of a sketching procedure (i.e., preprocessing…
We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…
We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…
We are presenting a simple and numerical stable algorithm for the solution of the cone projection problem which is suitable for relative small data sets and for simulation purposes needed for convexity tests. Not even one pseudo-inverse…
An exactly solvable model for the rewiring dynamics of weighted, directed networks is introduced. Simulations indicate that the model exhibits two types of condensation: (i) a phase in which, for each node, a finite fraction of its total…
Estimating the regular normal cone to constraint systems plays an important role for the derivation of sharp necessary optimality conditions. We present two novel approaches and introduce a new stationarity concept which is stronger than…
In this paper we derive a Newton type method to solve the non-linear system formed by combining the Tikhonov normal equations and Morozov's discrepancy principle. We prove that by placing a bound on the step size of the Newton iterations…
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps…
This paper provides a multivariate extension of Bertoin's pathwise construction of a L\'evy process conditioned to stay positive/negative. Thus obtained processes conditioned to stay in half-spaces are closely related to the original…
We characterize the notion of definable compactness for topological spaces definable in o-minimal structures, answering questions of Peterzil and Steinhorn (1999) and Johnson (2018). Specifically, we prove the equivalence of various…
The method of alternating projections (MAP) is a common method for solving feasibility problems. While employed traditionally to subspaces or to convex sets, little was known about the behavior of the MAP in the nonconvex case until 2009,…
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…
Skew-symmetric families of distributions such as the skew-normal and skew-$t$ represent supersets of the normal and $t$ distributions, and they exhibit richer classes of extremal behaviour. By defining a non-stationary skew-normal process,…
In this short note, we extend to the continuous case a mean projection theorem for discrete determinantal point processes associated with a finite range projection, thus strengthening a known result in random linear algebra due to Ermakov…
Given a demonstration of a complex manipulation task, such as pouring liquid from one container to another, we seek to generate a motion plan for a new task instance involving objects with different geometries. This is nontrivial since we…
The drawdown process of an one-dimensional regular diffusion process $X$ is given by $X$ reflected at its running maximum. The drawup process is given by $X$ reflected at its running minimum. We calculate the probability that a drawdown…
Consider the problem of planning collision-free motion of $n$ objects in the plane movable through contact with a robot that can autonomously translate in the plane and that can move a maximum of $m \leq n$ objects simultaneously. This…
In this paper we address the statistical problem of testing if a stationary process is Gaussian. The observation consists in a finite sample path of the process. Using a random projection technique introduced and studied in Cuesta-Albertos…
A local projection model is defined by a set of linear regressions that account for the associations between exogenous variables and an endogenous variable observed at different time points. While it is standard practice to separately…
A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow…