Unconstrained Optimization Computer Project

  • ステータス 終了
  • 予算 $10 - $30 USD
  • Total Bids 11

プロジェクト情報

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.

このようなプロジェクトの無料見積もりを取得

Looking to make some money?

  • 予算と期限を設定してください
  • Outline your proposal
  • Get paid for your work

このプロジェクトにも入札したフリーランサーを採用する

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