{"id":32155878,"url":"https://github.com/darnstrom/daqp","last_synced_at":"2026-02-22T14:39:50.751Z","repository":{"id":40624980,"uuid":"403531535","full_name":"darnstrom/daqp","owner":"darnstrom","description":"A dual active-set algorithm for convex quadratic programming","archived":false,"fork":false,"pushed_at":"2026-01-18T12:06:52.000Z","size":555,"stargazers_count":96,"open_issues_count":12,"forks_count":18,"subscribers_count":4,"default_branch":"master","last_synced_at":"2026-01-18T18:56:17.724Z","etag":null,"topics":["active-set-method","control","model-predictive-control","numerical-optimization","optimization","quadratic-programming"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/darnstrom.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2021-09-06T07:46:36.000Z","updated_at":"2026-01-18T12:06:56.000Z","dependencies_parsed_at":"2023-02-19T07:01:15.194Z","dependency_job_id":"22aa2ba6-6683-47bc-8d26-a5a0efbd16db","html_url":"https://github.com/darnstrom/daqp","commit_stats":null,"previous_names":[],"tags_count":11,"template":false,"template_full_name":null,"purl":"pkg:github/darnstrom/daqp","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darnstrom%2Fdaqp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darnstrom%2Fdaqp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darnstrom%2Fdaqp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darnstrom%2Fdaqp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/darnstrom","download_url":"https://codeload.github.com/darnstrom/daqp/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darnstrom%2Fdaqp/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29716358,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-22T13:30:57.152Z","status":"ssl_error","status_checked_at":"2026-02-22T13:30:28.561Z","response_time":110,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["active-set-method","control","model-predictive-control","numerical-optimization","optimization","quadratic-programming"],"created_at":"2025-10-21T12:17:24.124Z","updated_at":"2026-02-22T14:39:50.739Z","avatar_url":"https://github.com/darnstrom.png","language":"C","readme":" \n# DAQP\n[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)\n[![](https://img.shields.io/badge/docs-online-brightgreen)](https://darnstrom.github.io/daqp)\n\nDAQP is a dual active-set solver that solves convex quadratic programs of the form\n```\nminimize        0.5 x' H x + f' x\n\nsubject to      l  \u003c=  x  \u003c= u\n\t\t        bl \u003c=  Ax \u003c= bu.\n```\nBinary constraints of the form $A x \\in \\lbrace b_l, b_u \\rbrace$ are also supported, allowing for mixed-integer quadratic programs to be solved.\n\nThe code is written in C and is *library free*. DAQP can be interfaced to C, Julia, MATLAB, and Python. \n\n## Quick installation\n\n### Julia  \u003cimg src=\"https://cdn.jsdelivr.net/gh/devicons/devicon/icons/julia/julia-original.svg\" height=\"20\"/\u003e\n```bash\n] add DAQP\n```\n\n### MATLAB  \u003cimg src=\"https://cdn.jsdelivr.net/gh/devicons/devicon/icons/matlab/matlab-original.svg\" height=\"20\"/\u003e \n```bash\nwebsave('install_daqp','https://raw.githubusercontent.com/darnstrom/daqp/master/interfaces/daqp-matlab/install_daqp.m')\ninstall_daqp\n```\n\n### Python  \u003cimg src=\"https://cdn.jsdelivr.net/gh/devicons/devicon/icons/python/python-original.svg\" height=\"20\" /\u003e\n```bash\npip install daqp\n```\n\n### Details \nSee the [Documentation](https://darnstrom.github.io/daqp/start) for more detailed installation instructions and basic use of the interfaces. \n\n## Citing DAQP\n```\n@article{arnstrom2022dual,\n  author={Arnström, Daniel and Bemporad, Alberto and Axehill, Daniel},\n  journal={IEEE Transactions on Automatic Control},\n  title={A Dual Active-Set Solver for Embedded Quadratic Programming Using Recursive {LDL}$^{T}$ Updates},\n  year={2022},\n  volume={67},\n  number={8},\n  pages={4362-4369},\n  doi={10.1109/TAC.2022.3176430}\n}\n```\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdarnstrom%2Fdaqp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdarnstrom%2Fdaqp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdarnstrom%2Fdaqp/lists"}