Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.00002 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913292074614784 |
|---|---|
| author | Tuenter, Hans J. H. |
| author_facet | Tuenter, Hans J. H. |
| contents | We consider the minimum distance projection in the $L_2$-norm from an arbitrary point in an $n$-dimensional, Euclidian space onto the canonical simplex. It is shown that this problem reduces to a univariate problem that can be solved by a simple algorithm. This optimization problem occurs in the setting of credit risk, where one has stochastic matrices that describe transition probabilities between different credit ratings, and one wants to determine the roots of these matrices, or close approximations to them. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_00002 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Minimum $L_2$-Distance Projection onto the Canonical Simplex: A Simple Algorithm Tuenter, Hans J. H. Optimization and Control We consider the minimum distance projection in the $L_2$-norm from an arbitrary point in an $n$-dimensional, Euclidian space onto the canonical simplex. It is shown that this problem reduces to a univariate problem that can be solved by a simple algorithm. This optimization problem occurs in the setting of credit risk, where one has stochastic matrices that describe transition probabilities between different credit ratings, and one wants to determine the roots of these matrices, or close approximations to them. |
| title | The Minimum $L_2$-Distance Projection onto the Canonical Simplex: A Simple Algorithm |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2404.00002 |