Unconstrained Optimization Computer Project

  • Status Ditutup
  • Anggaran $10 - $30 USD
  • Total Penawaran 11

Deskripsi Proyek

Implement your procedures on a computer.

1. Steepest Descent Algorithm. See Problem 10 in the document ‘[url removed, login to view]’ for details. For 10.(a) you may use any of the linear search algorithms covered in class.

2. Newton Algorithm. Test your algorithm using the same problems as in 10.(d).

3. BFGS Quasi-Newton Algorithm. See Problem 11 in the document ‘[url removed, login to view]’ for details. For 11.(a) you may use any of the linear search algorithms covered in class.

4. Conjugate Gradient Algorithm. For line search, you may use any of the linear search algorithms covered in class.

Dapatkan penawaran gratis untuk proyek seperti ini
Keahlian yang Diminta

Ingin menghasilkan uang?

  • Atur anggaran Anda dan kerangka waktunya
  • Uraikan proposal Anda
  • Dapatkan bayaran untuk pekerjaan Anda

Pekerjakan para freelancer yang juga menawar di proyek ini

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online