{"repository":{"description":"NMTR is a trust region method for the solution of dense unconstrained optimization problems. In our implementation the trust region step is determined by the gqt subroutine of Moré and Sorensen.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":140,"owner":"fabianp","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"FORTRAN","created_at":"2013-10-11T03:54:58-07:00","pushed_at":"2013-10-11T03:55:09-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Fabian Pedregosa","company":"INRIA","blog":"http://fa.bianp.net","location":"Paris","email":"4a0a19218e082a343a1b17e5333409af9d98f0f5@bianp.net"},"url":"https://github.com/fabianp/nmtr/compare/master"}