Multi-dimensional function extremum seeking an algorithm proposed by Nelder and Mead, also called the simplex algorithm, but in the linear programming simplex algorithm is different, because not to use any derivation operator, the algorithm is relatively simple, but slow convergence, the number of variables fit the equation is not a lot of extremal

单纯形算法.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．