Abstract
The approximate or analytical computation of large scale sparse Hessian and Jacobian matrices can be improved using graph coloring. Although the coloring problem is NP-hard, several heuristics have been proved successful in practice. We intend to investigate the impact, in the solution of specific classes of optimization problems, of incorporating these heuristics in optimization routines…