Conversation
|
Excellent |
|
@amontoison |
|
@cvanaret We already require |
|
@cvanaret In the C interface, do you use LBFGS as fallback if the Hessian of the Lagrangian is not available? |
At the moment, BLAS is only required if one of the linear solvers (HSL or MUMPS) is linked. Obviously it's always the case for |
I don't do it yet, but it's the plan yes! Edit: done |
Yes, I think we should require them. We can rely more on it in the future this way. For example, the dot product can always be the one implemented in BLAS. |
|
OK, I solved the failing workflows (C and Fortran) by linking LAPACK and BLAS. |
701a6b5 to
1bc3f4d
Compare
5bada4c to
0184051
Compare
…ective_multiplier as parameters. Adapted the calls in LBFGSHessian
…boundedness with positive definite Hessian) except for hs109
…umented it in options.md
… current column of S and Y
…VectorView. Implemented special operation for y += a * x with BLAS
… in LBFGSHessian and PrimalDualInteriorPointProblem
… L_invsqrt_D^T + call to dgemm
… = (δ S + Y D⁻¹ Lᵀ) J⁻ᵀ with submatrices
|
Now I'm pretty proud of myself. I've implemented operator overloading/symbolic computations such that I can write the computation Uk = Sk;
Uk = this->delta * Uk + Vk * transpose(L_invsqrt_Dk);
Uk *= transpose(inverse(Jk));and BLAS is called under the hood ( |
… += alpha A^T A + calls to BLAS
|
@cvanaret Can you also add a small test for LBFGS in Fortran and Julia interfaces? |
@amontoison |
|
You need the finalize the model if you recreate a CUTEstModel from the same problem. |
|
@amontoison thanks, that's a wrap 😎 |
Support for L-BFGS.
Limited memory quasi-Newton Hessian approximations will be computed based on the compact QN representation (see Numerical optimization by Nocedal & Wright, pp 181-184).
@worc4021 @FrancoisGallard @leyffer
Builds upon and supersedes #150.