Difference between revisions of "Non-linear programming"
Jump to navigation
Jump to search
Kevin Dunn (talk | contribs) |
Kevin Dunn (talk | contribs) |
||
Line 7: | Line 7: | ||
| vimeoID3 = 119366104 | | vimeoID3 = 119366104 | ||
| vimeoID4 = 121094463 | | vimeoID4 = 121094463 | ||
| vimeoID5 = | | vimeoID5 = 121375922 | ||
| vimeoID6 = | | vimeoID6 = | ||
| vimeoID7 = | | vimeoID7 = | ||
Line 31: | Line 31: | ||
| video_download_link4_MP4_size = 640 M | | video_download_link4_MP4_size = 640 M | ||
| video_notes4 = | | video_notes4 = | ||
| video_download_link5_MP4 = | | video_download_link5_MP4 = https://www.dropbox.com/s/ieteak2gpshre4t/2015-4G3-Class-08B.mp4?dl=1 | ||
| video_download_link5_MP4_size = | | video_download_link5_MP4_size = 923 M | ||
| video_notes5 = | | video_notes5 = | ||
| video_download_link6_MP4 = | | video_download_link6_MP4 = | ||
Line 124: | Line 124: | ||
| align="left" colspan="1"| | | align="left" colspan="1"| | ||
[https://docs.google.com/document/d/1tISkFj7nYa3RV7G8LF4S_nD7dMzb7_ATwY0z4gslDT0 Handout from class] | [https://docs.google.com/document/d/1tISkFj7nYa3RV7G8LF4S_nD7dMzb7_ATwY0z4gslDT0 Handout from class] | ||
| | | [https://www.dropbox.com/s/ieteak2gpshre4t/2015-4G3-Class-08B.mp4?dl=1 Video] | ||
|align="left" colspan="1"| | |align="left" colspan="1"| | ||
Code used in class (see below) | Code used in class (see below) |
Revision as of 16:53, 5 March 2015
Class date(s): | 04 February 2015 | ||||
| |||||
| |||||
| |||||
| |||||
| |||||
Resources
Scroll down, if necessary, to see the resources.
Date | Class number | Topic | Slides/handouts for class | Video file | References and Notes |
---|---|---|---|---|---|
04 February | 05A |
|
Video | ||
09 February | 06A |
|
Video | ||
11 February | 06B |
|
Video | ||
16 to 27 February | 07 |
Reading week break and midterm | |||
02 March | 08A |
|
Video | ||
04 March | 08B |
|
Video |
Code used in class (see below) |
Taking full Newton's steps to solve the class example
clear all;
close all;
clc;
[X1,X2] = meshgrid(-0.5:0.1:6, 0:0.01:9);
Z = func(X1,X2);
contour(X1, X2, Z)
hold on
grid on
x = [1,3]';
plot(x(1), x(2), 'o')
text(x(1)+0.2, x(2), '0')
for k = 1:10
slope = -first_deriv(x)
step = hessian(x)\slope; % Solves the Ax=b problem, as x = A\b
x = x + step;
plot(x(1), x(2), '*')
text(x(1)+0.1, x(2), num2str(k))
end
func.m
function y = func(x1,x2)
y = 4.*x1.*x2 - 5.*(x1-2).^4 - 3.*(x2-5).^4;
first_deriv.m
function y = first_deriv(x)
y = [4*x(2) - 20*(x(1)-2)^3;
4*x(1) - 12*(x(2)-5)^3];
hessian.m
function y = hessian(x)
y = [-60*(x(1)-2)^2, 4;
4, -36*(x(2)-5)^2];