Abstract
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. >
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.
