Finite data performance of MUSIC and minimum norm methods

1994 ◽  
Vol 30 (1) ◽  
pp. 161-174 ◽  
Author(s):  
K.R. Srinivas ◽  
V.U. Reddy
Keyword(s):  
Minimum Norm ◽  
Finite Data

scholarly journals Inducing strong convergence of trajectories in dynamical systems associated to monotone inclusions with composite structure

2020 ◽  
Vol 10 (1) ◽  
pp. 450-476
Author(s):  
Radu Ioan Boţ ◽  
Sorin-Mihai Grad ◽  
Dennis Meier ◽  
Mathias Staudigl
Keyword(s):  
Dynamical Systems ◽  
Strong Convergence ◽  
Equilibrium Problems ◽  
Monotone Operators ◽  
Inclusion Problem ◽  
Minimum Norm ◽  
Monotone Inclusion ◽  
Inclusion Problems ◽  
Monotone Inclusion Problem ◽  
Maximally Monotone Operators

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.

The Equational Specification of Finite Minimal Unoids Using only Unary Hidden Functions

1982 ◽  
Vol 5 (2) ◽  
pp. 143-170
Author(s):  
Jan A. Bergstra ◽  
John-Jules Ch. Meyer
Keyword(s):  
Data Type ◽  
Bounded Number ◽  
Special Case ◽  
Finite Data

In [5] it has been proved that by using hidden functions the number of equations needed to specify a finite data type is bounded by numbers depending only on the signature of that data type. In the special case of a finite minimal unoid, however, it seems to be relevant to ask whether or not a specification can also be made by a bounded number of equations using only unary hidden functions. In this paper we prove that this can be done.

scholarly journals A Modified Mann Iteration by Boundary Point Method for Finding Minimum-Norm Fixed Point of Nonexpansive Mappings

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Songnian He ◽  
Wenlong Zhu
Keyword(s):  
Fixed Point ◽  
Strong Convergence ◽  
Boundary Point ◽  
Real Hilbert Space ◽  
Nonexpansive Mappings ◽  
Iteration Process ◽  
Point Method ◽  
Minimum Norm ◽  
Mann Iteration ◽  
Boundary Point Method

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.

Sign in / Sign up

Export Citation Format

Share Document