Evaluation of a minimum-norm based beamforming technique, sLORETA, for reducing tonic muscle contamination of EEG at sensor level

2017 ◽  
Vol 288 ◽  
pp. 17-28 ◽  
Author(s):  
Azin S. Janani ◽  
Tyler S. Grummett ◽  
Trent W. Lewis ◽  
Sean P. Fitzgibbon ◽  
Emma M. Whitham ◽  
...  
2020 ◽  
Vol 10 (1) ◽  
pp. 450-476
Author(s):  
Radu Ioan Boţ ◽  
Sorin-Mihai Grad ◽  
Dennis Meier ◽  
Mathias Staudigl

Abstract In this work we investigate dynamical systems designed to approach the solution sets of inclusion problems involving the sum of two maximally monotone operators. Our aim is to design methods which guarantee strong convergence of trajectories towards the minimum norm solution of the underlying monotone inclusion problem. To that end, we investigate in detail the asymptotic behavior of dynamical systems perturbed by a Tikhonov regularization where either the maximally monotone operators themselves, or the vector field of the dynamical system is regularized. In both cases we prove strong convergence of the trajectories towards minimum norm solutions to an underlying monotone inclusion problem, and we illustrate numerically qualitative differences between these two complementary regularization strategies. The so-constructed dynamical systems are either of Krasnoselskiĭ-Mann, of forward-backward type or of forward-backward-forward type, and with the help of injected regularization we demonstrate seminal results on the strong convergence of Hilbert space valued evolutions designed to solve monotone inclusion and equilibrium problems.


2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Songnian He ◽  
Wenlong Zhu

LetHbe a real Hilbert space andC⊂H a closed convex subset. LetT:C→Cbe a nonexpansive mapping with the nonempty set of fixed pointsFix(T). Kim and Xu (2005) introduced a modified Mann iterationx0=x∈C,yn=αnxn+(1−αn)Txn,xn+1=βnu+(1−βn)yn, whereu∈Cis an arbitrary (but fixed) element, and{αn}and{βn}are two sequences in(0,1). In the case where0∈C, the minimum-norm fixed point ofTcan be obtained by takingu=0. But in the case where0∉C, this iteration process becomes invalid becausexnmay not belong toC. In order to overcome this weakness, we introduce a new modified Mann iteration by boundary point method (see Section 3 for details) for finding the minimum norm fixed point of Tand prove its strong convergence under some assumptions. Since our algorithm does not involve the computation of the metric projectionPC, which is often used so that the strong convergence is guaranteed, it is easy implementable. Our results improve and extend the results of Kim, Xu, and some others.


2015 ◽  
Vol 08 (02) ◽  
pp. 1550036
Author(s):  
H. Zegeye ◽  
O. A. Daman

We introduce an iterative process which converges strongly to the minimum-norm fixed point of Lipschitzian pseudocontractive mapping. As a consequence, convergence result to the minimum-norm zero of monotone mappings is proved. In addition, applications to convexly constrained linear inverse problems and convex minimization problems are included. Our theorems improve and unify most of the results that have been proved for this important class of nonlinear operators.


Sign in / Sign up

Export Citation Format

Share Document