sage.numerical.optimize.minimize_constrained versus fmincon
Matlab has this function: http://www.mathworks.com/help/toolbox...
And as far as I can tell, Sage's closest equivalent is this: http://www.sagemath.org/doc/reference...
I use the inequality feature of
fmincon. I think that the
cons lambdas can achieve the same thing, although: will the performance worsen? Since fmincon can run an interior-point method with knowledge of the boundary, will the convergence be better there than with minimize_constrained? Is there some implementation of an interior-point method that I'm not seeing in Sage?