6.12 Solve the following equations using the steepest descent method (two iterations only) with the starting...

  

Transcribed Image Text:

6.12 Solve the following equations using the steepest descent method (two iterations only) with the starting point, X1 = {0 0 0}: 2x1 + x2 = 4, x +2x2 + x3 = 8, x2 +3x3 = 11 6.47 Solve the following system of equations using Newton's method of unconstrained mini- mization with the starting point X1 = 2x1 – x2 + x3 = -1, x1 + 2x2 = 0, 3x1 + x2 + 2x3 = 3 6.48 It is desired to solve the following set of equations using an unconstrained optimization method:| x? + y? = 2, 10x? – 10y – 5x +1 = o Formulate the corresponding problem and complete two iterations of optimization using the DFP method starting from X1 = {8}. 6.12 Solve the following equations using the steepest descent method (two iterations only) with the starting point, X1 = {0 0 0}: 2x1 + x2 = 4, x +2x2 + x3 = 8, x2 +3x3 = 11 6.47 Solve the following system of equations using Newton's method of unconstrained mini- mization with the starting point X1 = 2x1 – x2 + x3 = -1, x1 + 2x2 = 0, 3x1 + x2 + 2x3 = 3 6.48 It is desired to solve the following set of equations using an unconstrained optimization method:| x? + y? = 2, 10x? – 10y – 5x +1 = o Formulate the corresponding problem and complete two iterations of optimization using the DFP method starting from X1 = {8}.