相关论文: On circumcenter mappings induced by nonexpansive o…
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimization and nonsmooth analysis. Assuming that the resolvents of the operators are available, this problem can be tackled with the…
We introduce regularity notions for averaged nonexpansive operators. Combined with regularity notions of their fixed point sets, we obtain linear and strong convergence results for quasicyclic, cyclic, and random iterations. New convergence…
We analyse the behaviour of the newly introduced cyclic Douglas-Rachford algorithm for finding a point in the intersection of a finite number of closed convex sets. This work considers the case in which the target intersection set is…
Alternating projection based methods, such as ePIE and rPIE, have been used widely in ptychography. However, they only work well if there are adequate measurements (diffraction patterns); in the case of sparse data (i.e. fewer measurements)…
The Douglas-Rachford algorithm is a classical and powerful splitting method for minimizing the sum of two convex functions and, more generally, finding a zero of the sum of two maximally monotone operators. Although this algorithm is well…
Many large-scale and distributed optimization problems can be brought into a composite form in which the objective function is given by the sum of a smooth term and a nonsmooth regularizer. Such problems can be solved via a proximal…
This paper proposes a data-driven approach for constructing firmly nonexpansive operators. We demonstrate its applicability in Plug-and-Play (PnP) methods, where classical algorithms such as Forward-Backward splitting, Chambolle-Pock…
The numerical simulation of realistic reactive flows is a major challenge due to the stiffness and high dimension of the corresponding kinetic differential equations. Manifold-based model reduction techniques address this problem by…
Linear projection schemes like Proper Orthogonal Decomposition can efficiently reduce the dimensions of dynamical systems but are naturally limited, e.g., for convection-dominated problems. Nonlinear approaches have shown to outperform…
Time--convolutionless (TCL) master equations can break down at long times: time-local perturbative generators develop secular growth in correlation-dominated regimes. We mitigate this by a regulated, partially resummed reconstruction of the…
We report a simple, novel sub-diffraction method, i.e. diffraction interference induced super-focusing in second-harmonic (SH) Talbot effect, to achieve focusing size of less than {\lambda}_pump/8 without involving evanescent waves or…
In this paper, we develop a new regularized version of the Factorization Method for positive operators mapping a complex Hilbert Space into it's dual space. The Factorization Method uses Picard's Criteria to define an indicator function to…
Generalized circumcenters have been recently introduced and employed to speed up classical projection-type methods for solving feasibility problems. In this note, circumcenters are enforced in a new setting; they are proven to provide…
In this paper we consider a generalized version of bounded oscillation operators, involving new parameters in the definition, as well as considering the operators on vector-valued function spaces. With this definition we will capture some…
We first study crossing statistics in random connection models (RCM) built on marked Poisson point processes on $\mathbb R^d$. Under general assumptions, we show exponential tail bounds for the number of crossings of a box contained in the…
The induction and reduction precesses of an O*-vector space $\M$ obtained by means of a projection taken, respectively, in $\M$ itself or in its weak bounded commutant $\M'_\w$ are studied. In the case where $\M$ is a partial GW*-algebra,…
We have developed a McMurchie-Davidson-like recursion formula for efficient evaluation of the Coulomb attraction and interaction matrix elements between two-dimensional primitive Cartesian Gaussian type orbitals. We also present recurrence…
Many machine learning problems involve regressing variables on a non-Euclidean manifold -- e.g. a discrete probability distribution, or the 6D pose of an object. One way to tackle these problems through gradient-based learning is to use a…
This paper is devoted to deriving the first circumcenter iteration scheme that does not employ a product space reformulation for finding a point in the intersection of two closed convex sets. We introduce a so-called centralized version of…
Rational curves on Hilbert schemes of points on $K3$ surfaces and generalised Kummer manifolds are constructed by using Brill-Noether theory on nodal curves on the underlying surface. It turns out that all wall divisors can be obtained, up…