Adds solveLCP(f_eval, lb, ub, [var_name], [con_name]) and solveLCP(f_eval, M, lb, ub, [var_name], [con_name]). This avoids the call to ForwardDiff.jacobian at every iteration, so it should be much faster for problems which are actually linear.
Coverage decreased (-2.2%) to 97.778% when pulling 18976df27273578c3d28509e7c539a583fe6799b on rdeits:lcp into 7e4928af53c1e6be91a288f8fe048777a6a1b3e4 on chkwon:master.
Adds
solveLCP(f_eval, lb, ub, [var_name], [con_name])
andsolveLCP(f_eval, M, lb, ub, [var_name], [con_name])
. This avoids the call to ForwardDiff.jacobian at every iteration, so it should be much faster for problems which are actually linear.