Alternating projections with applications to Gerchberg-Saxton error reduction

04/05/2021
by   Dominikus Noll, et al.
0

We consider convergence of alternating projections between non-convex sets and obtain applications to convergence of the Gerchberg-Saxton error reduction method, of the Gaussian expectation-maximization algorithm, and of Cadzow's algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2020

On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections

A popular method for finding the projection onto the intersection of two...
research
02/12/2018

Convergence Analysis of Alternating Nonconvex Projections

We consider the convergence properties for alternating projection algori...
research
06/06/2021

Method of Alternating Projection for the Absolute Value Equation

A novel approach for solving the general absolute value equation Ax+B|x|...
research
09/03/2023

Probabilistic Reduced-Dimensional Vector Autoregressive Modeling for Dynamics Prediction and Reconstruction with Oblique Projections

In this paper, we propose a probabilistic reduced-dimensional vector aut...
research
04/07/2020

Optimal Projections for Gaussian Discriminants

The problem of obtaining optimal projections for performing discriminant...
research
02/15/2023

On Finite-Step Convergence of the Non-Greedy Algorithm for L_1-Norm PCA and Beyond

The non-greedy algorithm for L_1-norm PCA proposed in <cit.> is revisite...
research
07/23/2012

Bellman Error Based Feature Generation using Random Projections on Sparse Spaces

We address the problem of automatic generation of features for value fun...

Please sign up or login with your details

Forgot password? Click here to reset