A note on computing the Smallest Conic Singular Value
arXiv:1807.02589h-index: 13
AI Analysis
Provides a new computational tool for a specific matrix property, but the problem is niche and the contribution is incremental.
The authors study the smallest conic singular value of a matrix using Lagrangian duality and provide an efficient computational method.
The goal of this note is to study the smallest conic singular value of a matrix from a Lagrangian duality viewpoint and provide an efficient method for its computation.