{"payload":{"header_redesign_enabled":false,"results":[{"id":"425028330","archived":false,"color":"#a270ba","followers":6,"has_funding_file":false,"hl_name":"sean-lo/OptimalMatrixCompletion.jl","hl_trunc_description":"A custom branch-and-bound algorithm for solving low-rank matrix completion to certifiable optimality ","language":"Julia","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":425028330,"name":"OptimalMatrixCompletion.jl","owner_id":55531289,"owner_login":"sean-lo","updated_at":"2023-12-22T05:48:35.428Z","has_issues":true}},"sponsorable":false,"topics":["branch-and-bound","semidefinite-optimization","low-rank-matrix-completion","disjunctive-programming"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":111,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Asean-lo%252FOptimalMatrixCompletion.jl%2B%2Blanguage%253AJulia","metadata":null,"csrf_tokens":{"/sean-lo/OptimalMatrixCompletion.jl/star":{"post":"Dj4zuheROBISeGE4qrLahpLI3leeF0UlaXl6UCUjYDK2oULqOKO4OvfhxOjxNas0xhUMFYEulzvzQlqUeTF2FA"},"/sean-lo/OptimalMatrixCompletion.jl/unstar":{"post":"QxefCazCpZNQ0jzx3Hl3B0FQG8Ro4iHE6CrvypizrRL17Eddiv4JBXK5INmYI9Gd8Qnttaqg06s3RfyfFIr4bA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"YsILEuB93jTsZ7wg7LvYrczVcks_KRTSwOr_QUoG811SVg7PU9ufK5eNfsUE2dvvctbe2rf---y_ucrqak20nw"}}},"title":"Repository search results"}