Exact convergence of a parallel textured algorithm for constrained economic dispatch control problems

The constrained real power economic dispatch control problem is solved in parallel by a textured decomposition based algorithm. Sufficient conditions and rigorous proofs for the proposed algorithm to converge to the global minimum solution are described. It is first shown that, for a textured decomposition, the algorithm always converges to a stationary point, which may not be a global minimum. Then, it is proved that, if the conditions of the exact convergence theorem are satisfied, the textured algorithm will converge to a global minimum.<
>