{"payload":{"header_redesign_enabled":false,"results":[{"id":"379984295","archived":false,"color":"#a270ba","followers":24,"has_funding_file":false,"hl_name":"JuliaFirstOrder/SeparableOptimization.jl","hl_trunc_description":"A Julia package that solves Linearly Constrained Separable Optimization Problems using ADMM.","language":"Julia","mirror":false,"owned_by_organization":true,"public":true,"repo":{"repository":{"id":379984295,"name":"SeparableOptimization.jl","owner_id":86390710,"owner_login":"JuliaFirstOrder","updated_at":"2021-07-19T18:47:09.675Z","has_issues":true}},"sponsorable":false,"topics":["optimization","julia","julia-language","constrained-optimization","admm","proximal-algorithms","proximal-operators","prox","convex-optimization","piecewise","first-order-methods","convex","quadratic","first-order","linearly-separable","nonsmooth-optimization","admm-algorithm","piecewise-quadratic","separable-optimization","linearly-constrained"],"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":49,"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%253AJuliaFirstOrder%252FSeparableOptimization.jl%2B%2Blanguage%253AJulia","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/JuliaFirstOrder/SeparableOptimization.jl/star":{"post":"lO3VS4Mw_MhXdK5gLQk42wpdZ2MGI04VU9KKw-IopTR_wkHh5vJ3Yplw56ovaVtXQJ6ZPYWjLEB9hLTwdlAEIA"},"/JuliaFirstOrder/SeparableOptimization.jl/unstar":{"post":"s3Ouf-pq1z41Gi_bL2D9wDcjH27X9947kQcooaoavg-0UiQMK3qT6vJA5uL16JdNh4tINj71Ix-jRmAAe2duAA"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"KuWvjvhGhgyyhDgeTbuNh0BPLxfsM_IWrN24wdPJf3bnCoFTI7Zb9c1iDYpqubMcrPJjo2573YSQ739ycy1jYg"}}},"title":"Repository search results"}