Abstract
The authors improve the performance of the original iterative aggregation disaggregation gradient projection (IAD-GP) algorithm based on the idea of A/D only. The A/D concept naturally fits the hierarchical structure of the large wide area data networks and one would expect speed-up effects. Furthermore, by adding to the modified IAD-GP iteration decomposition/composition (D/C) steps, the authors propose a new algorithm called HAD (hierarchical A/D and D/C)-GP algorithm. The HAD-GP algorithm achieves significant improvement in convergence speed. This speed-up is demonstrated by numerical implementations comparing the HAD-GP algorithm with the modified IAD-GP and the ordinary GP (ORD-GP) algorithms. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
