Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: fmincon question
Replies: 1   Last Post: Jan 21, 2013 10:55 AM

 Alan Weiss Posts: 1,430 Registered: 11/27/08
Re: fmincon question
Posted: Jan 21, 2013 10:55 AM

On 1/21/2013 1:34 AM, Haemish wrote:
> Dear sir,
>
> I use fmincon function for a constraint minimization problem.
>
> I have some problems about fmincon and would you mind giving me an
>
> When I use fmincon, the function has a form of
> '[x,fval]=fmincon(@objfun,x0,[],[],[],[],lb,ub,@confun,options)'
>
> And there is an simple example of x0 = 0, lb = 0, ub = 10.
>
> Even thoug I put the lb and ub non-negative, I think that the
> searching is executed on the area of all (negative ~ 0 ~ positive).
> And the final answer is found between lb and ub.
>
> But is there any way to find an answer in the domain of definition of
> lb to ub?
> In my real problem, it is essential to find a solution in the limited
> area (not searching out of that).
>
> Sincerely yours,
>
> Thank you.
>
> Minjae Kim

Take a look at the documentation on bound constraints:
http://www.mathworks.com/help/optim/ug/writing-constraints.html#br9p_ry

This shows which algorithms satisfy bounds at all iterations.

Alan Weiss
MATLAB mathematical toolbox documentation