Uni Siegen OAI Repository
metadata only
(L)IPMP source code, v1-2020 (PhD-Thesis)
This is the first publication of a source code of the (Learning) Inverse Problem Matching Pursuits ((L)IPMPs) by NS. The software was developed during the PhD-Thesis of NS. The main code is written in C/C++ using the GSL and the NLopt library. The visualization codes are written in Matlab. We advise
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Complexity of BFGS Method for Smooth Convex Optimization#617683
- On the Complexity of BFGS Method for Smooth Convex Optimization#617183
- Constitutive Priors for Inverse Design#662425
- Constitutive Priors for Inverse Design#661375
- 2. The RADx Tech Program#2080
Record · ID 937337
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive