Scribd
Upload
61 views1 page

UGPA3033 Tutorial 2 PDF

This document provides instructions to calculate the minimum of the function f(x) = -8x1 + x12 + 12x2 + 4x22 - 2x1x2 using three different optimization methods: (a) steepest descent method, (b) conjugate gradient method, and (c) Newton's method. The initial point is x0 = (0, 0) and all methods should perform three iterations.

Uploaded by

Tko Kai Onn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
61 views1 page

UGPA3033 Tutorial 2 PDF

This document provides instructions to calculate the minimum of the function f(x) = -8x1 + x12 + 12x2 + 4x22 - 2x1x2 using three different optimization methods: (a) steepest descent method, (b) conjugate gradient method, and (c) Newton's method. The initial point is x0 = (0, 0) and all methods should perform three iterations.

Uploaded by

Tko Kai Onn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

UGPA3033 PROCESS OPTIMIZATION AND SIMULATION

TUTORIAL 2

Calculate the minimum of f(x) = –8x1 + x12 + 12 x2 + 4 x22 – 2 x1x2 by using:


(a) Steepest descent method,
(b) Conjugate gradient method,
(c) Newton’s method.
0
Use x0 = ( ) as initial point and perform THREE (3) iterations for all methods mentioned above.
0

You might also like