Optimization: principles and algorithms, by Michel Bierlaire
run0711df.m
Go to the documentation of this file.
1 %> \file
2 %> Runs example 7.11 with Newton's method with finite differences (Tables 8.4 and 8.5), n variables
3 %>
4 %> @ingroup Running
5 %> @ingroup chap08
6 %> @author <a href="http://people.epfl.ch/michel.bierlaire">Michel Bierlaire</a>
7 %> @date Thu Mar 19 18:36:22 2015
8 
9 %> @note Calls \ref newtonFinDiffNVariables
10 
11 x0 = [1 ; 1] ;
12 tau = 1.0e-7 ;
13 root = newtonFinDiffNVariables('ex0711',x0,tau,1.0e-15)
14 
15 tau = 0.1 ;
16 root = newtonFinDiffNVariables('ex0711',x0,tau,1.0e-15)
17 
18 
function ex0711(in x)
Example 7.11 in .
Copyright 2015-2016 Michel Bierlaire