2 papers
math.OC2026
Finding Maximum Determinant Principal Submatrices via Hadamard Bounds and Projection Methods
Hao Hu, Stefan Sremac, Hugo J. Woerdeman +1
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This…
math.OC2025
A Convex Optimization Approach to the Discrete Hanging Chain Problem
Russell Gabrys, Stefan Sremac
In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show…