Abstract
This paper attempts to provide minimization algorithms which are adapted to execution on parallel computers. For this purpose, three well-known nongradient methods are examined. From these, three parallel iterative procedures are derived, by discussing in detail their mathematical behavior, when the cooperating processes are either synchronous or asynchronous.
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.
