JuliaNLSolvers / NLSolversBase.jl

Base package for optimization and equation solver software in JuliaNLSolvers
Other
30 stars 28 forks source link

'only' constructors with TwiceDifferentiableHv #109

Closed tlienart closed 5 years ago

tlienart commented 5 years ago

This is in view of https://github.com/JuliaNLSolvers/Optim.jl/issues/738 @pkofod

This may break Optim in that the call to fg is now the "standard" format used elsewhere IE: (f, g, x) instead of just (g, x); I'll open a PR for Optim soon too.

PS: failure on nightly are due to the project toml not being up to date, see PR #108

Edit marked as "do not merge" for now, the ambiguity of calling convention for fg either with (g, x) or (f, g, x) is causing me some trouble now ok, see also https://github.com/JuliaNLSolvers/Optim.jl/pull/742

codecov[bot] commented 5 years ago

Codecov Report

Merging #109 into master will increase coverage by 0.13%. The diff coverage is 100%.

Impacted file tree graph

@@            Coverage Diff            @@
##           master    #109      +/-   ##
=========================================
+ Coverage   93.46%   93.6%   +0.13%     
=========================================
  Files          10      10              
  Lines         490     500      +10     
=========================================
+ Hits          458     468      +10     
  Misses         32      32
Impacted Files Coverage Δ
src/NLSolversBase.jl 80% <ø> (ø) :arrow_up:
src/objective_types/twicedifferentiablehv.jl 100% <100%> (ø) :arrow_up:
src/objective_types/incomplete.jl 98% <100%> (+0.32%) :arrow_up:

Continue to review full report at Codecov.

Legend - Click here to learn more Δ = absolute <relative> (impact), ø = not affected, ? = missing data Powered by Codecov. Last update 6af840c...71c6403. Read the comment docs.

pkofod commented 5 years ago

Welcome to the frightening world of NLSolversBase :) I will have a look as soon as possible. Thanks

tlienart commented 5 years ago

bump?

pkofod commented 5 years ago

Great, looks good! Sorry for the long wait.