[Scilab-users] Constrained optimization speed vs. unconstrained

[Tim Wescott]

"optim" allows you to submit a constraints vector for the optimization.

How much does using constrained optimization affect the optimization
speed?  I.e., take the wholly hypothetical case where I'm optimizing
some function f(x) with binf and bsup specified, and that the
optimization never ever hits binf or bsup.

Is the constrained optimization slower than the unconstrained
optimization?  Is there any general way, short of doing the experiment,
to know how much slower?

Thanks in advance...

-- 

Tim Wescott
www.wescottdesign.com
Control & Communications systems, circuit & software design.
Phone: 503.631.7815
Cell:  503.349.8432