Computing cone-constrained singular values of matrices
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916051350978560 |
|---|---|
| author | Barbarino, Giovanni Gillis, Nicolas Sossa, David |
| author_facet | Barbarino, Giovanni Gillis, Nicolas Sossa, David |
| contents | This paper deals with the numerical computation of the least singular value of a rectangular matrix $A$ relative to a pair of closed convex cones $(P,Q)$, which is defined as the optimal value of the non-convex optimization problem of minimizing $\langle u,Av\rangle$ such that $u$ and $v$ are unit vectors in $P$ and $Q$, respectively. When $A$ is the identity matrix, the least singular value coincides with the cosine of the largest angle between $P$ and $Q$. When $P$ and $Q$ are positive orthants, the least singular value is called the least Pareto singular value of $A$ and has applications, for instance, in graph theory. We prove the NP-hardness of all the above problems, while identifying cases when such problems can be solved in polynomial time. We then propose four algorithms. Two are exact algorithms, meaning that they are guaranteed to compute a globally optimal solution; one uses an exact non-convex quadratic programming solver, and the other a brute-force active-set method. The other two are heuristics, meaning that they rapidly compute locally optimal solutions; one uses an alternating projection algorithm with extrapolation, and the other a sequential partial linearization approach based on fractional programming. We illustrate the use of these algorithms on several examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_04069 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Computing cone-constrained singular values of matrices Barbarino, Giovanni Gillis, Nicolas Sossa, David Optimization and Control Numerical Analysis This paper deals with the numerical computation of the least singular value of a rectangular matrix $A$ relative to a pair of closed convex cones $(P,Q)$, which is defined as the optimal value of the non-convex optimization problem of minimizing $\langle u,Av\rangle$ such that $u$ and $v$ are unit vectors in $P$ and $Q$, respectively. When $A$ is the identity matrix, the least singular value coincides with the cosine of the largest angle between $P$ and $Q$. When $P$ and $Q$ are positive orthants, the least singular value is called the least Pareto singular value of $A$ and has applications, for instance, in graph theory. We prove the NP-hardness of all the above problems, while identifying cases when such problems can be solved in polynomial time. We then propose four algorithms. Two are exact algorithms, meaning that they are guaranteed to compute a globally optimal solution; one uses an exact non-convex quadratic programming solver, and the other a brute-force active-set method. The other two are heuristics, meaning that they rapidly compute locally optimal solutions; one uses an alternating projection algorithm with extrapolation, and the other a sequential partial linearization approach based on fractional programming. We illustrate the use of these algorithms on several examples. |
| title | Computing cone-constrained singular values of matrices |
| topic | Optimization and Control Numerical Analysis |
| url | https://arxiv.org/abs/2504.04069 |