A note on computing the Smallest Conic Singular Value
Stephane Chretien
TL;DR
This paper investigates the smallest conic singular value of a matrix using Lagrangian duality and proposes an efficient computational method.
Contribution
It introduces a novel approach based on Lagrangian duality to compute the smallest conic singular value efficiently.
Findings
Provides a new duality-based method for computation.
Demonstrates improved efficiency over existing techniques.
Offers theoretical insights into the conic singular value.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.