Results 1 - 10
of
499,721
Tradeoff to minimize extra-computations and stopping criterion tests for parallel iterative schemes
- In PMAA’04 Parallel Matrix Algorithms and Applications. CIRM
, 2004
"... tests for parallel iterative schemes ..."
AN ITERATIVE SCHEME FOR SOLVING NONLINEAR EQUATIONS WITH MONOTONE OPERATORS
"... An iterative scheme for solving ill-posed nonlinear operator equations with monotone operators is introduced and studied in this paper. A discrete version of the Dynamical Systems Method (DSM) algorithm for stable solution of ill-posed operator equations with monotone operators is proposed and its c ..."
Abstract
-
Cited by 13 (6 self)
- Add to MetaCart
An iterative scheme for solving ill-posed nonlinear operator equations with monotone operators is introduced and studied in this paper. A discrete version of the Dynamical Systems Method (DSM) algorithm for stable solution of ill-posed operator equations with monotone operators is proposed and its
Novel iteration schemes for the Cluster Variation Method
- Advances in Neural Information Processing Systems 14
, 2001
"... The Cluster Variation method is a class of approximation methods containing the Bethe and Kikuchi approximations as special cases. We derive two novel iteration schemes for the Cluster Variation Method. One is a fixed point iteration scheme which gives a significant improvement over loopy BP, mean f ..."
Abstract
-
Cited by 22 (2 self)
- Add to MetaCart
The Cluster Variation method is a class of approximation methods containing the Bethe and Kikuchi approximations as special cases. We derive two novel iteration schemes for the Cluster Variation Method. One is a fixed point iteration scheme which gives a significant improvement over loopy BP, mean
Iterative schemes for solving mixed variational-like inequalities
- J. Optim. Theory Appl
"... Abstract. In the present paper, we introduce the concept of η-cocoer-civity of a map and develop some iterative schemes for finding the approximate solutions of mixed variational-like inequalities. We use the concept of η-cocoercivity to prove the convergence of the approximate solutions to the exac ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
Abstract. In the present paper, we introduce the concept of η-cocoer-civity of a map and develop some iterative schemes for finding the approximate solutions of mixed variational-like inequalities. We use the concept of η-cocoercivity to prove the convergence of the approximate solutions
CONVERGENCE AND STABILITY RESULTS FOR SOME ITERATIVE SCHEMES
"... Abstract. We obtain strong convergence results for quasi-contractive operators in arbitrary Banach space via some recently introduced iterative schemes and also establish stablity theorems for Kirk’s iterative process. Our results generalize and extend some well-known results in the literature. ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract. We obtain strong convergence results for quasi-contractive operators in arbitrary Banach space via some recently introduced iterative schemes and also establish stablity theorems for Kirk’s iterative process. Our results generalize and extend some well-known results in the literature.
A Cyclic Douglas–Rachford Iteration Scheme
"... In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine s ..."
Abstract
-
Cited by 16 (9 self)
- Add to MetaCart
In this paper we present two Douglas–Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine
Convergence of Iterative Schemes for Multivalued Quasi-Variational Inclusions
"... Relying on the resolvent operator method and using Nadler's theorem, we suggest and analyze a class of iterative schemes for solving multivalued quasi-variational inclusions. In fact, by considering problems involving composition of mutivalued operators and by replacing the usual compactness co ..."
Abstract
- Add to MetaCart
Relying on the resolvent operator method and using Nadler's theorem, we suggest and analyze a class of iterative schemes for solving multivalued quasi-variational inclusions. In fact, by considering problems involving composition of mutivalued operators and by replacing the usual compactness
A fast iterative shrinkage-thresholding algorithm with application to . . .
, 2009
"... We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast Iterat ..."
Abstract
-
Cited by 1055 (8 self)
- Add to MetaCart
We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast
Iterative decoding of binary block and convolutional codes
- IEEE Trans. Inform. Theory
, 1996
"... Abstract- Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the ..."
Abstract
-
Cited by 600 (43 self)
- Add to MetaCart
Abstract- Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms
Results 1 - 10
of
499,721