Provides 'Scilab' 'n1qn1', or Quasi-Newton BFGS "qn" without constraints and 'qnbd' or Quasi-Newton BFGS with constraints. This takes more memory than traditional L-BFGS. The n1qn1 routine is useful since it allows prespecification of a Hessian. If the Hessian is near enough the truth in optimization it can speed up the optimization problem. Both algorithms are described in the 'Scilab' optimization documentation located at <http://www.scilab.org/content/download/250/1714/file/optimization_in_scilab.pdf>.
copied from cf-staging / r-n1qn1
https://anaconda.org/conda-forge/r-n1qn1/badges/version.svg
https://anaconda.org/conda-forge/r-n1qn1/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-n1qn1/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-n1qn1/badges/platforms.svg
https://anaconda.org/conda-forge/r-n1qn1/badges/license.svg
https://anaconda.org/conda-forge/r-n1qn1/badges/downloads.svg