|
|
 |
| found 67 articles for 0.302 sec |
  |
|
| "okr k" <okr_k@yahoo.com.hk> wrote in message
<g3159q$fht$1@fred.mathworks.com>...
> I've used fminsearch for an optimization problem, the
> result is close to what I expected, however it wasted
> quite a lot of time on running over some not critical
> parts, so, I want to try for the fmincon with specifying
> the lower and upper bound:
>
> x = fmincon(fun,x0,[],[],[],[],lowerbound,upperbound |
|
 |
|
 |
Group: uw.cs.cs240 · Group Profile · Search for Lowerbound in uw.cs.cs240
Author: (Eric) Yu Chen
Date: Jun 20, 2008 09:47
I've used fminsearch for an optimization problem, the result is close to what I expected, however it wasted quite a lot of time on running over some not critical parts, so, I want to try for the fmincon with specifying the lower and upper bound: x = fmincon(fun,x0,[],[],[],[],lowerbound,upperbound) however, no matter how I change the boundaries, the optimized result is just same as
|
| Show full article (3.91Kb) · Show article thread |
| "Doug Disabato" <ddisabato@phys.mcw.edu> wrote in message
<g2m6ta$d5h$1@fred.mathworks.com>...
> Use optimset. For instance, you can use this code:
>
> options = optimset('fmincon')
> options = optimset(options,'MaxFunEvals',(number here))
>
> Then, when you use fmincon, just use the options.
>
> fmincon(@myfun,param,[],[],[],[],lowerbound,upperbound,
> [],options)
>
> Hope this helps
|
|
|
|
|
Group: comp.softsys.matlab · Group Profile · Search for Lowerbound in comp.softsys.matlab
Author: okr k
Date: Jun 15, 2008 11:11
Here is a roadmap to make things connected. Hopefully, you could see the connections between "a sequence of decisions" with "a decision tree." Before anything, make sure you understand this: Why we care about a decision tree? That is related to the lowerbound proof (check lec7). Now try to understand all of the following. Then, go to read my comments in your post. First of all, think
|
| Show full article (1.57Kb) · Show article thread |
|
|
|
1 ·
2 ·
3 ·
4 ·
5 ·
6 ·
7 ·
next |
|
|
