Fast Globally Optimal Catalog Matching using MIQCP

Fast Globally Optimal Catalog Matching using MIQCP

We propose a novel exact method to solve the probabilistic catalog matching problem faster than previously possible. Our new approach uses mixed integer programming and introduces quadratic constraints to shrink the problem by multiple orders of magnitude. We also provide a method to use a feasible...

Full description

Bibliographic Details
Main Authors: Jacob Feitelberg, Amitabh Basu, Tamás Budavári
Format: Article
Language:English
Published: IOP Publishing 2023-01-01
Series:The Astronomical Journal
Subjects:
Astronomical methods
Catalogs
Photometry
Bayes factor
Online Access:https://doi.org/10.3847/1538-3881/acf5e2

Similar Items

Similar Items