cateater2000
Nov6-04, 12:32 AM
Hi I'm having real trouble with this question. Any hints or ideas would be great.
Give an algorithm which depends only on (exact) minimization along lines, and which minimizes a quadratic in 3 variables(with Hessian matrix >0 ) after finitely many line searches. What is the minimal number of line searches required (for a general starting point)?
Thanks in advance
Give an algorithm which depends only on (exact) minimization along lines, and which minimizes a quadratic in 3 variables(with Hessian matrix >0 ) after finitely many line searches. What is the minimal number of line searches required (for a general starting point)?
Thanks in advance