)]}'
{
  "commit": "6851a6386162f5de3a22dc03b379e6c70ca117bc",
  "tree": "4274df9f243c4ac719a42b4405b635a8f5c32d41",
  "parents": [
    "8202edcbb4d5bf77dd5484fd05f6442b34ec3d70"
  ],
  "author": {
    "name": "Alex Stewart",
    "email": "alexs.mac@gmail.com",
    "time": "Fri Apr 06 18:23:11 2018 +0100"
  },
  "committer": {
    "name": "Alex Stewart",
    "email": "alexs.mac@gmail.com",
    "time": "Fri Apr 06 19:57:38 2018 +0100"
  },
  "message": "Fix lower-bound on result of minimising step-size polynomial.\n\n- Previously we were requesting a step-size which minimised the\n  polynomial in: [previous.x, current.x * factor].\n- This is incorrect c/f Nocedal \u0026 Wright p60, the bounds for the\n  minimising step-size should be: [current.x, current.x * factor].\n- However, Nocedal \u0026 Wright\u0027s bounds are insufficient when the function\n  can return invalid values, which we support.\n- In the case that f(current) is invalid, we need to contract the\n  step-size to lie within: [previous.x, current.x) given that we know\n  that previous.x is valid so a valid step must exist within that range.\n\nChange-Id: I67b5aaa09cc6d54cf5f264e2cf894ddc2af3f3ad\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "86302a91b7c3d33817ace2c8f96726ac43ccdb7e",
      "old_mode": 33188,
      "old_path": "internal/ceres/line_search.cc",
      "new_id": "dd73b0efdf2f6726ed915d5c49badbd7f332f3d1",
      "new_mode": 33188,
      "new_path": "internal/ceres/line_search.cc"
    }
  ]
}