Abstract
In this paper, we consider optimization of polynomials in a parallel computing environment. Algorithms for optimization of polynomials can be used to solve NP-hard control problems such as stability of nonlinear and delayed systems. Unfortunately, the high computational costs of current algorithms such as sum-of-squares has limited its use to relatively small problems. In this paper we review several results on polynomial representation which and show that these results can be used to develop an algorithm for polynomial optimization with a naturally parallel structure. In particular, we design and implement a massively parallel algorithm in MPI which tests positivity of polynomials. Test results confirm that the implementation has high efficiency with relatively low overhead.
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.
