Hello,
I have filed this Bug report and also provided a fixed version (on Github):
https://issues.apache.org/jira/browse/VFS-490
https://github.com/ecki/seeburger-vfs2/blob/master/vfs2provider-jdbctable/src/main/java/com/seeburger/vfs2/util/VFSClassLoader.java#L152
Greetings
Bernd
Am 16.08.201
Hello,
I want to use the VFSClassLoader on JAR files and Directories (to provide
resources). My problem is, that some directories are exploded archives and
have a name with a .jar extension.
The addFileObjects() of the VFSClassLoader uses canCreateFileSystem() to
detect, if for a given fi
If you're talking about analysis.differentiation package. I'm looking
forward to using it.
Though, my main point in this thread was that if one can compute the
hessian, it should be possible in certain cases to speed up convergence
rather than depending on an update rule to estimate an *approximat
Le 16/08/2013 18:55, Ajo Fod a écrit :
> The algorithm computes the Hessian using an update rule. My question was
> what if you can compute the hessian analytically?
>
> Hessian: http://en.wikipedia.org/wiki/Hessian_matrix
> Gradient: http://en.wikipedia.org/wiki/Gradient
We do have support to he
The algorithm computes the Hessian using an update rule. My question was
what if you can compute the hessian analytically?
Hessian: http://en.wikipedia.org/wiki/Hessian_matrix
Gradient: http://en.wikipedia.org/wiki/Gradient
Cheers,
-Ajo
On Fri, Aug 16, 2013 at 9:39 AM, Luc Maisonobe wrote:
> L
Le 15/08/2013 22:59, Ajo Fod a écrit :
> Hello,
>
> Is'nt there an advantage to being able to compute the Jacobian of the
> gradient precisely at a point?
>
> If so, is there a class that uses the Jacobian instead of estimating the
> jacobian from the last few iteration as NonLinearConjugateGradi