Skip to content

Commit 00cd18d

Browse files
authored
Update algorithm.md
1 parent d675884 commit 00cd18d

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

docs/src/algorithm.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -84,11 +84,11 @@ that has been split d times will have a width of $3^−d$. If we have $n$ dimens
8484
r = \sqrt{\left( \frac{1}{2 \cdot 3^{-d_1}} \right)^2 , \ldots , \left( \frac{1}{2 \cdot 3^{-d_n}} \right)^2}
8585
```
8686
---
87-
1. Interval splitting in multiple dimensions for DIRECT requires choosing an ordering for the split dimensions
87+
- Interval splitting in multiple dimensions for DIRECT requires choosing an ordering for the split dimensions
8888

8989
![page_16](https://github.com/user-attachments/assets/962993d9-372a-4733-9d1f-0260cdacdff1)
9090

91-
2. DIRECT will only split the longest dimensions of intervals. The algorithm only divides intervals larger than a minimum radius. This minimum radius prevents inefficient function evaluations very close to existing points.
91+
- DIRECT will only split the longest dimensions of intervals. The algorithm only divides intervals larger than a minimum radius. This minimum radius prevents inefficient function evaluations very close to existing points.
9292

9393
![page_17](https://github.com/user-attachments/assets/99caea66-02b5-4371-90e2-69305c035ddf)
9494

0 commit comments

Comments
 (0)