1988
DOI: 10.1007/bf01580731
|View full text |Cite
|
Sign up to set email alerts
|

Convergence of relaxation algorithms by averaging

Abstract: Adaptive relaxation algorithms use anti-jamming schemes that require either a large amount of computation or a large amount of memory.ot this paper~ present5 a non-adaptive approach that possesses substantial computational and memory advantages over the adaptive schemes. The approach uses averaging and may be applied whenever the relaxation algorithm's point-to-set maps satisfy appropriate assumptions.IDWYRIBUtMON ST&TEMEI 3 ._A

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1988
1988
1995
1995

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…D. dissertation [8]. The research results concerning the convergence properties of relaxation algorithms that are used in parallel schemes have been published in Mathematical Programming [2].…”
Section: Research Objectives and Statusmentioning
confidence: 99%
“…D. dissertation [8]. The research results concerning the convergence properties of relaxation algorithms that are used in parallel schemes have been published in Mathematical Programming [2].…”
Section: Research Objectives and Statusmentioning
confidence: 99%