I finally ported my code from 0.5.2 to 0.6.0 and discovered that a test run that took 8h35min in 0.5.2 now takes 15hr in 0.6.0. I have traced the performance problem to the following statement, which takes over 7 times longer in 0.6.0 than in 0.5.2:
bobhess = [hessxx hessxs hessxt hessxs' hessss hessst hessxt' hessst' hesstt]
in which all the entries
hesstt are sparse matrices or vectors. Is this a known issue? (If not, I’ll open one.) Is there a workaround?