Premium
A Parallel Block Scaled Gradient Method With Decentralized Step‐Size For Block Additive Unconstrained Optimization Problems Of Large Distributed Systems
Author(s) -
Lin ShinYeu,
Lin ShiehShing
Publication year - 2003
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1111/j.1934-6093.2003.tb00101.x
Subject(s) - block (permutation group theory) , speedup , computer science , convergence (economics) , block size , algorithm , mathematical optimization , parallel computing , mathematics , geometry , computer security , key (lock) , economics , economic growth
In this paper, we propose a modified parallel block scaled gradient method for solving block additive unconstrained optimization problems of large distributed systems. Our method makes two major modifications to the typical parallel block scaled gradient method: First, we include a pre‐processing step which reduces the computational time; second, we propose a decentralized Armijo‐type step‐size rule. This rule circumvents the difficulty of determining a step‐size in a distributed computing environment and enables the proposed parallel algorithm to execute in a distributed computer network with a limited amount of data transfer. We have applied our method to the weighted‐least‐square problems of power system state estimation and demonstrated the convergence of our method by testing numerous examples on a PC network. The speedup ratio of the distributed version of our method tends to increase proportionally with the number of subsystems (or computers).