{"id":28365560,"url":"https://github.com/osqp/osqp-r","last_synced_at":"2025-10-12T06:36:14.298Z","repository":{"id":45577145,"uuid":"128075417","full_name":"osqp/osqp-r","owner":"osqp","description":"R interface for OSQP","archived":false,"fork":false,"pushed_at":"2024-06-08T05:30:11.000Z","size":170,"stargazers_count":13,"open_issues_count":6,"forks_count":7,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-06-18T21:40:32.537Z","etag":null,"topics":["admm","convex-optimization","lasso","machine-learning","operator-splitting","quadratic-programming","r"],"latest_commit_sha":null,"homepage":"https://osqp.org/","language":"R","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/osqp.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-04-04T14:37:11.000Z","updated_at":"2025-06-13T12:31:16.000Z","dependencies_parsed_at":"2023-02-17T00:00:45.506Z","dependency_job_id":"b565804e-5a4c-4900-816b-1feef3c42513","html_url":"https://github.com/osqp/osqp-r","commit_stats":null,"previous_names":[],"tags_count":9,"template":false,"template_full_name":null,"purl":"pkg:github/osqp/osqp-r","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp-r","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp-r/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp-r/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp-r/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/osqp","download_url":"https://codeload.github.com/osqp/osqp-r/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp-r/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279010515,"owners_count":26084757,"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","status":"online","status_checked_at":"2025-10-12T02:00:06.719Z","response_time":53,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["admm","convex-optimization","lasso","machine-learning","operator-splitting","quadratic-programming","r"],"created_at":"2025-05-28T22:10:17.102Z","updated_at":"2025-10-12T06:36:14.292Z","avatar_url":"https://github.com/osqp.png","language":"R","funding_links":[],"categories":[],"sub_categories":[],"readme":"# R interface for OSQP\n\n\u003c!-- badges: start --\u003e\n[![R-CMD-check](https://github.com/osqp/osqp-r/actions/workflows/R-CMD-check.yaml/badge.svg)](https://github.com/osqp/osqp-r/actions/workflows/R-CMD-check.yaml)\n[![CRAN\\_Status\\_Badge](https://www.r-pkg.org/badges/version/osqp)](https://cran.r-project.org/package=osqp)\n[![](https://cranlogs.r-pkg.org/badges/osqp)](https://CRAN.R-project.org/package=osqp)\n\u003c!-- badges: end --\u003e\n\nProvides R-bindings to [OSQP](https://osqp.org/): the Operator\nSplitting QP Solver.\n\nThe OSQP (Operator Splitting Quadratic Program) solver is a numerical\noptimization package for solving problems in the form\n\n    minimize        0.5 x' P x + q' x\n\n    subject to      l \u003c= A x \u003c= u\n\nwhere `x in R^n` is the optimization variable. The objective function is\ndefined by a positive semidefinite matrix `P in S^n_+` and vector\n`q in R^n`. The linear constraints are defined by matrix\n`A in R^{m x n}` and vectors `l in R^m U {-inf}^m`,\n`u in R^m U {+inf}^m`.\n\n## Documentation\n\nThe interface is documented [here](https://osqp.org/).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fosqp%2Fosqp-r","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fosqp%2Fosqp-r","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fosqp%2Fosqp-r/lists"}