Skip to content

Commit be9c53e

Browse files
committed
add citation of the preprint
1 parent 15a74ce commit be9c53e

2 files changed

Lines changed: 11 additions & 1 deletion

File tree

docs/src/references.bib

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -87,6 +87,16 @@ @article{BacakBergmannSteidlWeinmann:2016
8787
VOLUME = {38},
8888
}
8989

90+
@misc{BaranBergmannPrzybysz:2026,
91+
title = {A {Riemannian} quasi-{Newton} algorithm for optimization with {Euclidean} bounds},
92+
doi = {10.48550/arXiv.2605.10573},
93+
publisher = {arXiv},
94+
author = {Baran, Mateusz and Bergmann, Ronny and Przybysz, Patryk},
95+
month = may,
96+
year = {2026},
97+
note = {arXiv:2605.10573 [math.OC]},
98+
}
99+
90100
@inproceedings{Beale:1972,
91101
ADDRESS = {London},
92102
AUTHOR = {Beale, E. M. L.},

docs/src/solvers/generalized_cauchy_direction_subsolver.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Generalized Cauchy direction subsolver
22

3-
The generalized Cauchy direction (GCD) subsolver is a component in optimization algorithms that handle problems with bound constraints. It solves the following problem
3+
The generalized Cauchy direction (GCD) subsolver is a component in optimization algorithms that handle problems with bound constraints [BaranBergmannPrzybysz:2026](@cite). It solves the following problem
44

55
```math
66
\begin{align*}

0 commit comments

Comments
 (0)