Hello, everyone. I'm having a large scale unconstrained optimization problem. If I treat the unconstrained problem as a constrained problem with infinity constraints, I should be able to use both the fminunc and fmincon function. When using the fminunc function, I should provide the gradient and the sparse pattern of the Hessian. While using the fmincon function, I can choose the l-bfgs method to approximate the Hessian. So, here is my question. Which one converges faster? Are there any good reasons to choose one over another? Or any principles to guide such choice?
MATLAB: Which algorithm converges faster
fminconfminunclbfgsoptimizationOptimization Toolbox
Best Answer