---
title: "CUTEst.jl: papers citing this dataset"
description: "4 papers in the tracked journals link to the Zenodo dataset CUTEst.jl in their Crossref records, the first in 2022; most of them (2) in 2023."
url: https://scholar4ai.com/code/zenodo-1188851
markdown_url: https://scholar4ai.com/code/zenodo-1188851.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "4 papers in the tracked journals link to the Zenodo dataset CUTEst.jl in their Crossref records, the first in 2022; most of them (2) in 2023. (as of 2026-11-03)"
data_url: https://scholar4ai.com/data/rankings.json
updated: 2026-11-03T14:43:26+09:00
window: 2026-10-05 to 2026-11-03
source: OpenAlex (CC0)
---

# CUTEst.jl: papers linking to it

Research papers in the 480 tracked journals that link to CUTEst.jl (https://doi.org/10.5281/zenodo.1188851), read from their Crossref records: by year, category and journal, the family tree of papers building on one another, and the linked repositories derived from it or that it derives from.

- Zenodo
- Software
- 2026
- archives github.com/juliasmoothoptimizers/cutest.jl
- https://doi.org/10.5281/zenodo.1188851

All repositories: https://scholar4ai.com/code.md

## Key findings

- 4 papers in the tracked journals link to the Zenodo dataset CUTEst.jl in their Crossref records, the first in 2022; most of them (2) in 2023.
- By category: Operations Research (4); the journals with the most are Mathematical Programming (2) and Computational Optimization and Applications (2).
- It is a Zenodo archive of JuliaSmoothOptimizers/CUTEst.jl, which other papers here link to as well.

## By year

*Papers linking to CUTEst.jl by publication year*

| Year | Papers |
|---|---:|
| 2022 | 1 |
| 2023 | 2 |
| 2025 | 1 |

## Journals

*Journals whose papers link to CUTEst.jl most*

| Journal | Papers |
|---|---:|
| [Mathematical Programming](https://scholar4ai.com/journals/mathematical-programming.md) | 2 |
| [Computational Optimization and Applications](https://scholar4ai.com/journals/computational-optimization-and-applications.md) | 2 |

## Related repositories

*Linked repositories CUTEst.jl derives from or that derive from it*

| Repository | Relation | Papers |
|---|---|---:|
| [JuliaSmoothOptimizers/CUTEst.jl](https://scholar4ai.com/code/github-juliasmoothoptimizers-cutest-jl.md) | CUTEst.jl is its Zenodo archive | 3 |

## Papers

*Papers linking to CUTEst.jl, most cited first*

| Published | Title | Journal | Authors | Citations | Link |
|---|---|---|---|---:|---|
| 2022-06-30 | [An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians](https://doi.org/10.1007/s10107-022-01846-z) | [Mathematical Programming](https://scholar4ai.com/journals/mathematical-programming.md) | Sen Na, Mihai Anitescu, Mladen Kolar | 30 | cites it |
| 2023-01-09 | [Secant penalized BFGS: a noise robust quasi-Newton method via penalizing the secant condition](https://doi.org/10.1007/s10589-022-00448-x) | [Computational Optimization and Applications](https://scholar4ai.com/journals/computational-optimization-and-applications.md) | Brian Irwin, Eldad Haber | 9 | cites it |
| 2023-10-31 | [Scalable adaptive cubic regularization methods](https://doi.org/10.1007/s10107-023-02007-6) | [Mathematical Programming](https://scholar4ai.com/journals/mathematical-programming.md) | Jean‐Pierre Dussault, Tangi Migot, Dominique Orban | 9 | cites it |
| 2025-05-26 | [A unified approach for smoothing approximations to the exact $$\\ell _1$$-penalty for inequality-constrained optimization](https://doi.org/10.1007/s10589-025-00694-9) | [Computational Optimization and Applications](https://scholar4ai.com/journals/computational-optimization-and-applications.md) | Mariana da Rosa, Ademir A. Ribeiro, Elizabeth W. Karas | 1 | cites it |

## How this is measured

Links are read from each paper's Crossref record as its publisher deposited it: the URLs and repository DOIs in its reference list (the software and data it cites) and its supplementary links (“is-supplemented-by”: its own code or data). A paper that gives its code only in the text, a footnote or a data availability statement is not counted, and some publishers deposit reference lists without their URLs, so every count here is a lower bound. Repository details come from the GitHub REST API (stars, forks, and the repository a fork was made from), the Hugging Face Hub API (likes, downloads, and the base model a model was derived from) and DataCite (Zenodo and other data DOIs, and the GitHub release a Zenodo record archives), read again every month.

## Cite this page

Scholar4AI. (2026). CUTEst.jl: papers linking to it. Journal and Conference Research Rankings. Retrieved November 3, 2026, from https://scholar4ai.com/code/zenodo-1188851

```bibtex
@misc{scholar4ai-code-zenodo-1188851,
  author = {{Scholar4AI}},
  title = {CUTEst.jl: papers linking to it},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/code/zenodo-1188851}},
  urldate = {2026-11-03},
  note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
}
```

License: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/).