6 citations · 21 across the 15 of their papers we have counts for
19 papers
Lagrangian Dual Sections: A Topological Perspective on Hidden Convexity
Venkat Chandrasekaran, Timothy Duff, Jose Israel Rodriguez +1
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optim…
Using monodromy to recover symmetries of polynomial systems
Timothy Duff, Viktor Korotynskiy, Tomas Pajdla +1
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of e…
Geometric Solution to the Angles-Only Initial Orbit Determination Problem
Michela Mancini, Timothy Duff, Anton Leykin +1
Initial orbit determination (IOD) from line-of-sight (i.e., bearing) measurements is a classical problem in astrodynamics. Indeed, there are many well-established methods for perfo…
Line Multiview Ideals
Paul Breiding, Timothy Duff, Lukas Gustafsson +2
We study the following problem in computer vision from the perspective of algebraic geometry: Using pinhole cameras we take pictures of a line in . This produc…
SubalgebraBases in Macaulay2
Michael Burr, Oliver Clarke, Timothy Duff +3
We describe a recently revived version of the software package SubalgberaBases, which is distributed in the Macaulay2 computer algebra system. The package allows the user to comput…
-generation: solving systems of polynomials equation-by-equation
Timothy Duff, Anton Leykin, Jose Israel Rodriguez
We develop a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our method is based on a novel geometric construction, and r…