On the Complexity of Computing Critical Points with Gröbner Bases
From MaRDI portal
Publication:2934482
DOI10.1137/130936294zbMath1325.90072arXiv1309.2138OpenAlexW2066979034MaRDI QIDQ2934482
Publication date: 12 December 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.2138
Nonconvex programming, global optimization (90C26) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Solving polynomial systems; resultants (13P15)
Related Items (10)
The saddle point problem of polynomials ⋮ Refined F5 Algorithms for Ideals of Minors of Square Matrices ⋮ Faster real root decision algorithm for symmetric polynomials ⋮ Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ The data singular and the data isotropic loci for affine cones ⋮ Solving determinantal systems using homotopy techniques ⋮ Homotopy techniques for solving sparse column support determinantal polynomial systems ⋮ Critical points via monodromy and local methods ⋮ Bit complexity for computing one point in each connected component of a smooth real algebraic set ⋮ Computing critical points for invariant algebraic systems
This page was built for publication: On the Complexity of Computing Critical Points with Gröbner Bases
