S2MPJ and CUTEst optimization problems for Matlab, Python and Julia
<|reference_start|>S2MPJ and CUTEst optimization problems for Matlab, Python and Julia: A new decoder for the SIF test problems of the CUTEst collection is described, which produces problem files allowing the computation of values and derivatives of the objective function and constraints of most \cutest\ problems directly within ``native'' Matlab, Python or Julia, without any additional installation or interfacing with MEX files or Fortran programs. When used with Matlab, the new problem files optionally support reduced-precision computations.<|reference_end|>
@article{gratton2024s2mpj,
    title={S2MPJ and CUTEst optimization problems for Matlab, Python and Julia},
    author={Serge Gratton and Philippe L. Toint},
    journal={arXiv preprint arXiv:2407.07812},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.07812},
    primaryClass={math.OC cs.PF}
}