Closed d-monnet closed 2 months ago
All modified and coverable lines are covered by tests :white_check_mark:
Project coverage is 98.14%. Comparing base (
e14901a
) to head (fb73995
). Report is 4 commits behind head on main.:exclamation: Current head fb73995 differs from pull request most recent head 46a957b. Consider uploading reports for the commit 46a957b to get more accurate results
:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
I will modify/add tests to have a full coverage of armijo_goldstein
.
Add a line-search solver for the Armijo-Goldstein conditions. This is a direct implementation (M=0, no incumbent memory) of the method proposed in: Cartis, C., Sampaio, P.R., Toint, P.L.: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization. Optimization 64(5), 1349–1361 (2015).