{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:julia/OptimalMatrixCompletion","name":"OptimalMatrixCompletion","description":"A custom branch-and-bound algorithm for solving low-rank matrix completion to certifiable optimality ","version":"0.3.0","softwareVersion":"0.3.0","license":"https://spdx.org/licenses/MIT","codeRepository":"https://github.com/sean-lo/OptimalMatrixCompletion.jl","issueTracker":"https://github.com/sean-lo/OptimalMatrixCompletion.jl/issues","keywords":["branch-and-bound","low-rank-matrix-completion","semidefinite-optimization","disjunctive-programming"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Julia"},"dateCreated":"2023-05-15","dateModified":"2023-12-22","datePublished":"2023-12-22","copyrightYear":2023,"downloadUrl":"https://codeload.github.com/sean-lo/OptimalMatrixCompletion.jl/tar.gz/v0.3.0","softwareHelp":{"@type":"WebSite","url":"https://docs.juliahub.com/General/OptimalMatrixCompletion/stable/"},"applicationCategory":"julia","runtimePlatform":"julia","developmentStatus":"active","sameAs":["https://juliahub.com/ui/Packages/General/OptimalMatrixCompletion/"],"https://www.w3.org/ns/activitystreams#likes":6}