Schulz-Snyder Phase Retrieval Algorithm as an Alternating Minimization Algorithm

We derive the Schulz-Snyder phase retrieval algorithm as an alternating minimization method, and discuss its advantages and drawbacks. An annealing-type Schulz-Snyder algorithm is proposed to avoid convergence to nonglobal solutions. Numerical experiments which suggest the effectiveness of the proposed method are presented.
Computational Optical Sensing and Imaging, COSI 2011; 10 July - 14 July 2011


The Schur algorithm and reproducing kernel Hilbert spaces in the ball
Alpay, D; Bolotnikov, V; Kaptanoglu, HT (Elsevier BV, 2002-02-15)
Using reproducing kernel Hilbert spaces methods we develop a Schur-type algorithm for a subclass of the functions analytic and contractive in the ball. We also consider the Nevanlinna-Pick interpolation problem in that class. (C) 2002 Elsevier Science Inc. All rights reserved.
Inverse Sturm-Liouville Systems over the whole Real Line
Altundağ, Hüseyin; Taşeli, Hasan; Department of Mathematics (2010)
In this thesis we present a numerical algorithm to solve the singular Inverse Sturm-Liouville problems with symmetric potential functions. The singularity, which comes from the unbounded domain of the problem, is treated by considering the limiting case of the associated problem on the symmetric finite interval. In contrast to regular problems which are considered on a finite interval the singular inverse problem has an ill-conditioned structure despite of the limiting treatment. We use the regularization t...
Impulsive Hopfield-type neural network system with piecewise constant argument
Akhmet, Marat; Yılmaz, Elanur (2010-08-01)
In this paper we introduce an impulsive Hopfield-type neural network system with piecewise constant argument of generalized type. Sufficient conditions for the existence of the unique equilibrium are obtained. Existence and uniqueness of solutions of such systems are established. Stability criterion based on linear approximation is proposed. Some sufficient conditions for the existence and stability of periodic solutions are derived. An example with numerical simulations is given to illustrate our results.
Finite element analysis of electromagnetic scattering problems via iterative leap-field domain decomposition method
Ozgun, O.; Kuzuoğlu, Mustafa (2008-01-01)
We introduce the Iterative Leap-field Domain Decomposition Method (ILF-DDM), which is based on the dual employment of Finite Element Method and Huygens' Principle iteratively, for the solution of electromagnetic boundary value problems. The method can be applied to cases involving both multiple objects and a single 'challenging' object using the locally-conformal perfectly matched layer technique. We report some numerical results for two-dimensional electromagnetic scattering problems.
An interactive preference based multiobjective evolutionary algorithm for the clustering problem
Demirtaş, Kerem; Özdemirel, Nur Evin; Karasakal, Esra; Department of Industrial Engineering (2011)
We propose an interactive preference-based evolutionary algorithm for the clustering problem. The problem is highly combinatorial and referred to as NP-Hard in the literature. The goal of the problem is putting similar items in the same cluster and dissimilar items into different clusters according to a certain similarity measure, while maintaining some internal objectives such as compactness, connectivity or spatial separation. However, using one of these objectives is often not sufficient to detect differ...
Citation Formats
S. F. Öktem, “Schulz-Snyder Phase Retrieval Algorithm as an Alternating Minimization Algorithm,” presented at the Computational Optical Sensing and Imaging, COSI 2011; 10 July - 14 July 2011, Toronto; Canada, 2011, Accessed: 00, 2021. [Online]. Available: