OP-00118 Lean verified Critical-point counts for symmetric rank-two approximation with diagonal zeros AG · Euclidean distance degrees · low-rank approximations · OpenProblemsInNLA · symmetric matrices
OP-00212 Solution claimed Frobenius inner products minimize the algebraic complexity of rank-one approximation AG · Euclidean distance degrees · OpenProblemsInNLA · rank-one approximations · Segre–Veronese varieties
OP-00245 Solution claimed Critical-point count for corank-one approximation with a fixed zero AG · determinantal varieties · Euclidean distance degrees · low-rank approximations · OpenProblemsInNLA