The Maximum Likelihood Degree of Sparse Polynomial Systems
DOI10.1137/21m1422550arXiv2105.07449OpenAlexW4361285528MaRDI QIDQ6043375
Julia Lindberg, Nathan Nicholson, Jose Israel Rodriguez, Zinan Wang
Publication date: 5 May 2023
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.07449
Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Nonconvex programming, global optimization (90C26) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Computational aspects of higher-dimensional varieties (14Q15) Solving polynomial systems; resultants (13P15) Algebraic statistics (62R01)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algebraic degree of semidefinite programming
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Polyedres de Newton et nombres de Milnor
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- The maximum likelihood degree of toric varieties
- Maximum likelihood degree of variance component models
- Solving decomposable sparse systems
- Euclidean distance degree and mixed volume
- Moment maps, strict linear precision, and maximum likelihood degree one
- Criteria for strict monotonicity of the mixed volume of convex polytopes
- Solving the likelihood equations
- Estimating linear covariance models with numerical nonlinear algebra
- The euclidean distance degree
- The maximum likelihood degree of a very affine variety
- A general formula for the algebraic degree in semidefinite programming
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Algorithm 795
- Using Algebraic Geometry
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Semidefinite Optimization and Convex Algebraic Geometry
- Invariant Theory and Scaling Algorithms for Maximum Likelihood Estimation
- Maximum Likelihood Estimation for Matrix Normal Models via Quiver Representations
- Algebraic Degree of Polynomial Optimization
- Euclidean Distance Degree of the Multiview Variety
- The Maximum Likelihood Degree of Mixtures of Independence Models
- The maximum likelihood degree
- Maximum Likelihood Degree, Complete Quadrics, and $\mathbb{C}^*$-Action
This page was built for publication: The Maximum Likelihood Degree of Sparse Polynomial Systems
