Pages that link to "Item:Q4305440"
From MaRDI portal
The following pages link to Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems (Q4305440):
Displaying 12 items.
- Computation of the distance to semi-algebraic sets (Q4941311) (← links)
- Toric eigenvalue methods for solving sparse polynomial systems (Q5097381) (← links)
- A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation (Q5146689) (← links)
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems (Q5418491) (← links)
- A numerical algorithm to find soft-constrained Nash equilibria in scalar LQ-games (Q5491405) (← links)
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods (Q5931634) (← links)
- Exact line and plane search for tensor optimization (Q5963312) (← links)
- The Maximum Likelihood Degree of Sparse Polynomial Systems (Q6043375) (← links)
- Numerical homotopies from Khovanskii bases (Q6045334) (← links)
- Early Ending in Homotopy Path-Tracking for Real Roots (Q6108824) (← links)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)
- Polyhedral homotopies in Cox coordinates (Q6183986) (← links)