{"id":15025234,"url":"https://github.com/osqp/osqp","last_synced_at":"2025-05-14T02:05:24.659Z","repository":{"id":37233776,"uuid":"69313892","full_name":"osqp/osqp","owner":"osqp","description":"The Operator Splitting QP Solver","archived":false,"fork":false,"pushed_at":"2025-04-09T21:47:55.000Z","size":60137,"stargazers_count":1837,"open_issues_count":98,"forks_count":374,"subscribers_count":41,"default_branch":"master","last_synced_at":"2025-04-12T12:21:40.554Z","etag":null,"topics":["control","convex-optimization","lasso","machine-learning","model-predictive-control","numerical-optimization","optimization","portfolio-optimization","quadratic-programming","solver","svm"],"latest_commit_sha":null,"homepage":"https://osqp.org","language":"C","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":"CHANGELOG.md","contributing":"docs/contributing/index.rst","funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":"CITATION.cff","codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2016-09-27T03:02:46.000Z","updated_at":"2025-04-11T12:36:18.000Z","dependencies_parsed_at":"2023-10-02T21:15:02.447Z","dependency_job_id":"a40f616c-2d80-4c34-a598-f399bf0147b6","html_url":"https://github.com/osqp/osqp","commit_stats":{"total_commits":1617,"total_committers":32,"mean_commits":50.53125,"dds":0.2646876932591218,"last_synced_commit":"25b6b39247954b74bba17667863fe19e9a8b1ade"},"previous_names":["oxfordcontrol/osqp"],"tags_count":19,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/osqp%2Fosqp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/osqp","download_url":"https://codeload.github.com/osqp/osqp/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254052692,"owners_count":22006716,"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":["control","convex-optimization","lasso","machine-learning","model-predictive-control","numerical-optimization","optimization","portfolio-optimization","quadratic-programming","solver","svm"],"created_at":"2024-09-24T20:01:50.964Z","updated_at":"2025-05-14T02:05:19.644Z","avatar_url":"https://github.com/osqp.png","language":"C","funding_links":[],"categories":["Spacecraft GNC"],"sub_categories":["Descent And Landing"],"readme":"# The Operator Splitting QP Solver\n\n[![CI](https://github.com/osqp/osqp/actions/workflows/main.yml/badge.svg)](https://github.com/osqp/osqp/actions/workflows/main.yml)\n[![Code coverage](https://coveralls.io/repos/github/osqp/osqp/badge.svg?branch=master)](https://coveralls.io/github/osqp/osqp?branch=master)\n![License](https://img.shields.io/badge/License-Apache%202.0-brightgreen.svg)\n\n\n![PyPI - downloads](https://img.shields.io/pypi/dm/osqp.svg?label=Pypi%20downloads)\n![Conda - downloads](https://img.shields.io/conda/dn/conda-forge/osqp.svg?label=Conda%20downloads)\n\n[**Visit our GitHub Discussions page**](https://github.com/orgs/osqp/discussions) for any questions related to the solver!\n\n**The documentation** is available at [**osqp.org**](https://osqp.org/)\n\nThe OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving problems in the form\n```\nminimize        0.5 x' P x + q' x\n\nsubject to      l \u003c= A x \u003c= u\n```\n\nwhere `x in R^n` is the optimization variable. The objective function is defined by a positive semidefinite matrix `P in S^n_+` and vector `q in R^n`. The linear constraints are defined by matrix `A in R^{m x n}` and vectors `l` and `u` so that `l_i in R U {-inf}` and `u_i in R U {+inf}` for all `i in 1,...,m`.\n\n\n## Citing OSQP\n\nIf you are using OSQP for your work, we encourage you to\n\n* [Cite the related papers](https://osqp.org/citing/),\n* Put a star on this repository.\n\n**We are looking forward to hearing your success stories with OSQP!** Please [share them with us](mailto:bartolomeo.stellato@gmail.com).\n\n\n## Bug reports and support\n\nPlease report any issues via the [Github issue tracker](https://github.com/osqp/osqp/issues). All types of issues are welcome including bug reports, documentation typos, feature requests and so on.\n\n\n## Numerical benchmarks\nNumerical benchmarks against other solvers are available [here](https://github.com/osqp/osqp_benchmarks).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fosqp%2Fosqp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fosqp%2Fosqp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fosqp%2Fosqp/lists"}