
Limit on the change rate of the variable in fmincon function
8 次查看(过去 30 天)
显示 更早的评论
采纳的回答
Matt J
2019-11-12
编辑:Matt J
2019-11-12
You would build linear inequality matrices like the following.
E=diff(eye(numel(u)));
A=[E;-E]; b=[ub(:);-lb(:)]; %linear inequality matrices
21 个评论
Matt J
2019-11-14
编辑:Matt J
2019-11-14
It sounds like you're saying that at time u(t), the values of u(t-1) are already known. Then the bounds can be rewritten
lbnew <= u(t) <= ubnew
where lbnew and ubnew are the known bound vectors
ubnew=ub+u(t-1);
lbnew=lb+u(t-1);
They are known since u(t-1) is known. So, you now have plain ordinary bounds on u(t) and there is nothing special about the way you set up the problem.
But I need to emphasize that, if you have an objective f(t,u(t)) at each time t, the approach you are pursuing will not give you the minimum of
if that was your goal in all this. There is no way to do that by solving an independent problem at each t.

另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!