{"id":16722164,"url":"https://github.com/lostella/drs","last_synced_at":"2026-03-18T21:47:07.283Z","repository":{"id":21476029,"uuid":"24794652","full_name":"lostella/drs","owner":"lostella","description":"Numerical implementations of the Douglas-Rachford splitting (DRS), and an accelerated version of the method, for solving nonsmooth convex composite optimization problems","archived":false,"fork":false,"pushed_at":"2015-01-25T23:58:45.000Z","size":176,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-10T23:04:23.060Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Matlab","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lostella.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-10-04T16:26:52.000Z","updated_at":"2024-05-12T07:29:58.000Z","dependencies_parsed_at":"2022-08-21T14:40:33.524Z","dependency_job_id":null,"html_url":"https://github.com/lostella/drs","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lostella%2Fdrs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lostella%2Fdrs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lostella%2Fdrs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lostella%2Fdrs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lostella","download_url":"https://codeload.github.com/lostella/drs/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243733333,"owners_count":20339025,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-12T22:33:49.394Z","updated_at":"2026-01-02T17:05:58.391Z","avatar_url":"https://github.com/lostella.png","language":"Matlab","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Douglas-Rachford splitting\n\nThis repository contains implementations of the Douglas-Rachford operator\nsplitting method for solving convex optimization problems of the form\n\n```\nminimize f(x) + g(x)\n```\n\nThe proposed implementations and tests reflect the analysis contained in\n[1]. In particular, a *fast* version of the method is provided for problems\nwhere f(x) is quadratic.\n\nThe problems for which the algorithms are implemented are:\n* Box constrained QPs\n* L1-regularized least square regression\n\n### References\n\n[1] P. Patrinos, L. Stella, A. Bemporad, “Douglas-Rachford Splitting: Complexity\nEstimates and Accelerated Variants,” [arXiv:1407.6723](http://arxiv.org/abs/1407.6723) [math.OC], Sep. 2014.\nIn *Proceedings of the 53nd IEEE Conference on Decision and Control*.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flostella%2Fdrs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flostella%2Fdrs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flostella%2Fdrs/lists"}