Mathematics Homework Solutions
Problem
#11031

Optimization : Standard Conjugate Gradient Algorithm

Please see the attached file for the fully formatted problems.

We consider the function J defined as

and   .

1) Prove mathematically that K is strictly convex.
2) Descibe the two algorithms of conjugated gradient for this function K.
3) Are they descending algorithms?
4) Choose one of them, and choose a method to obtain the step in each iteration.
Write the first three iterations in detail for  .

Attached file(s):
Attachments
27 novembre 2002 - ex3.doc  View File

Attachment Content Summary (Note: view attachment at the above link before purchasing. Actual attachment content may vary slightly from that shown below.)

27 novembre 2002 - ex3.doc
We consider the function J defined as



.

Prove mathematically that K is trictly convex.

Descibe the two algorithms of conjugated gradiant for this function K.

Are they descending algorithms?

Choose one of them, and choose a method to obtain the step in each
iteration.

.

Solution Summary

The standard conjugate gradient algorithm is employed to solve optimization problems.

Solution
What is this?
By OTA - Overall OTA Rating
Departed OTA
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
  • Plain text response
  • Attached file(s):
    • optim_sol.doc
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Optimization Constraint Problems - Please see the attached file for the fully formatted problems.
  • Optimization - The management of a large store has 800 feet of fencing to fence in a rectangular storage yard using the building as one side of the yard. If fencing is used for the remaining sides, find the area of ...
  • optimization - I have a problem that needs to be solved using any numerical programming. It has been solved and two examples are provided for validation. The only thing missing is the procedure program. I prefer ...
  • Lagrange Multiplier Optimization - I am having difficulty with two constrained optimization problems using a lagrangian multiplier. Problem one as follows: Maxamize f(x,y)= x ^1/3 y^2/3 subject to x+2y=100 The next one is ...
  • Nonlinear Programming & Evolutionary Optimization - This is a problem #10, chapter 8 - Nonlinear Programming & Evolutionary Optimization, from the textbook by Cliff Ragsdale, "Spreadsheet Modeling and Decision Analysis". This problem requires the use ...
Browse