Critical points via monodromy and local methods. (March 2017)

• Record Type: Journal Article
• Authors: Martín del Campo, Abraham; Rodriguez, Jose Israel
• Is Part Of: Journal of symbolic computation. Volume 79:Part 3(2017)
• Page Start: 559
• Page End: 574
• Publication Date: 2017-03
• Subjects: Critical points -- Monodromy -- Homotopy continuation -- Gradient descent homotopy -- Maximum likelihood degree -- Euclidean distance -- Trace test; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2016.07.019
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: A fundamental problem in many areas of applied mathematics and statistics is to find the best representative of a model by optimizing an objective function. This can be done by determining critical points of the function restricted to the model. We compile ideas arising from numerical algebraic geometry to compute these critical points. Our method consists of using numerical homotopy continuation and a monodromy action on the total critical space to compute all of the complex critical points. To illustrate the relevance of our method, we apply it to the Euclidean distance function to compute ED-degrees and the likelihood function to compute maximum likelihood degrees.