Marc Härkönen
Abstract
The Macaulay2 [5] package AlgebraicOptimization implements methods for determining the algebraic degree of an optimization problem. We describe the structure of an algebraic optimization problem and explain how the methods in this package may be used to determine the respective degrees. Special features include determining Euclidean distance degrees and maximum likelihood degrees. To our knowledge, this is the first comprehensive software package combining different methods in algebraic optimization. The package is available at https://github.com/Macaulay2/Workshop-2020-Cleveland/tree/ISSAC-AlgOpt/alg-stat/AlgebraicOptimization.
- C. Améndola, N. Bliss, I. Burke, C. R. Gibbons, M. Helmer, S. Hosten, E. D. Nash, J. I. Rodriguez, and D. Smolkin. The maximum likelihood degree of toric varieties. J. Symbolic Comput., 92:222--242, 2019.Google Scholar
Cross Ref
- F. Catanese, S. Hoşten, A. Khetan, and B. Sturmfels. The maximum likelihood degree. Amer. J. Math., 128(3):671--697, 2006.Google ScholarCross Ref
- J. Draisma, E. Horobeţ, G. Ottaviani, B. Sturmfels, and R. R. Thomas. The Euclidean distance degree of an algebraic variety. Found. Comput. Math., 16(1):99--149, 2016.Google ScholarDigital Library
- H.-C. Graf von Bothmer and K. Ranestad. A general formula for the algebraic degree in semidefinite programming. Bull. Lond. Math. Soc., 41(2):193--197, 2009.Google ScholarCross Ref
- D. R. Grayson and M. E. Stillman. Macaulay2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/.Google Scholar
- S. Hoşten, A. Khetan, and B. Sturmfels. Solving the likelihood equations. Found. Comput. Math., 5(4):389--407, 2005.Google ScholarDigital Library
- P. Rostalski and B. Sturmfels. Dualities. In Semidefinite optimization and convex algebraic geometry, volume 13 of MOS-SIAM Ser. Optim., pages 203--249. SIAM, Philadelphia, PA, 2013.Google Scholar
Recommendations
Algebraic Degree of Polynomial Optimization
Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, we prove that the optimality conditions always hold on optimizers, and the coordinates of ...
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
Information systems play an important role in characterizing order structures. In this paper, we introduce the notions of the algebraic information system and algebraic L-information system. They are of the same logic-oriented style as the information ...
Comments