Related papers: Fourier Phase Retrieval with a Single Mask by Doug…
The recovery of a signal from the magnitudes of its transformation, like the Fourier transform, is known as the phase retrieval problem and is of big relevance in various fields of engineering and applied physics. In this paper, we present…
The Douglas--Rachford method is a splitting method frequently employed for finding zeroes of sums of maximally monotone operators. When the operators in question are normal cones operators, the iterated process may be used to solve…
Operator splitting schemes are a class of powerful algorithms that solve complicated monotone inclusion and convex optimization problems that are built from many simpler pieces. They give rise to algorithms in which all simple pieces of the…
Traditional phase-shifting interferometry technique cannot be used to measure time-varying phase distributions. But single shot techniques could resolve the problem. Many efforts have been made on the phase retrieval methods from a single…
The Douglas-Rachford algorithm is a classical and very successful method for solving optimization and feasibility problems. In this paper, we provide novel conditions sufficient for finite convergence in the context of convex feasibility…
We analyze the Douglas-Rachford splitting method for weakly convex optimization problems, by the token of the Douglas-Rachford envelope, a merit function akin to the Moreau envelope. First, we use epi-convergence techniques to show that…
Recently, several convergence rate results for Douglas-Rachford splitting and the alternating direction method of multipliers (ADMM) have been presented in the literature. In this paper, we show global linear convergence rate bounds for…
In this paper we give general recommendations for successful application of the Douglas-Rachford reflection method to convex and non-convex real matrix-completion problems. These guidelines are demonstrated by various illustrative examples.
We expand upon previous work that examined behavior of the iterated Douglas-Rachford method for a line and a circle by considering two generalizations: that of a line and an ellipse and that of a line together with a $p$-sphere. With…
This paper presents a novel approach on solving the phase problem in nuclear magnetic resonance (NMR) diffusion pore imaging, a method, which allows imaging the shape of arbitrary closed pores filled with an NMR-detectable medium for…
In this paper we consider the question of finding an as small as possible family of operators $(T_j)_{j\in J}$ on $L^2(R)$ that does phase retrieval: every $\varphi$ is uniquely determined (up to a constant phase factor) by the phaseless…
The Douglas-Rachford method is a popular splitting technique for finding a zero of the sum of two subdifferential operators of proper closed convex functions; more generally two maximally monotone operators. Recent results concerned with…
The Douglas-Rachford splitting algorithm is a classical optimization method that has found many applications. When specialized to two normal cone operators, it yields an algorithm for finding a point in the intersection of two convex sets.…
Douglas-Rachford method is a splitting algorithm for finding a zero of the sum of two maximal monotone operators. Each of its iterations requires the sequential solution of two proximal subproblems. The aim of this work is to present a…
In order to measure the radial displacements of facets on surface of a growing spherical Cu_{2-\delta}Se crystal with sub-nanometer resolution, we have investigated the reliability and accuracy of standard method of Fourier analysis of…
The ill-posed problem of phase retrieval in optics, using one or more intensity measurements, has a multitude of applications using electromagnetic or matter waves. Many phase retrieval algorithms are computed on pixel arrays using discrete…
We improve a phase retrieval approach that uses correlation-based measurements with compactly supported measurement masks [27]. The improved algorithm admits deterministic measurement constructions together with a robust, fast recovery…
The Douglas-Rachford algorithm can be represented as the fixed point iteration of a firmly nonexpansive operator. When the operator has no fixed points, the algorithm's iterates diverge, but the difference between consecutive iterates…
We study the convergence of the adaptive Douglas--Rachford (aDR) algorithm for solving a multioperator inclusion problem involving the sum of maximally comonotone operators. To address such problems, we adopt a product space reformulation…
In this paper, we investigate the uniqueness of the phase retrieval problem for the fractional Fourier transform (FrFT) of variable order. This problem occurs naturally in optics and quantum physics. More precisely, we show that if $u$ and…