Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
From MaRDI portal
Recommendations
- Symmetric Newton polytopes for solving sparse polynomial systems
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- Solving polynomial systems by polyhedral homotopies
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Parallel Homotopy Algorithms to Solve Polynomial Systems
- A Polyhedral Method for Sparse Systems with Many Positive Solutions
- Affine solution sets of sparse polynomial systems
- A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
- Fast linear homotopy to find approximate zeros of polynomial systems
Cited in
(69)- Deformation techniques for sparse systems
- How to count efficiently all affine roots of a polynomial system
- A sparse effective Nullstellensatz
- A convex geometric approach to counting the roots of a polynomial system
- Homotopies for solving polynomial systems within a bounded domain
- Real enumerative geometry and effective algebraic equivalence
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- Toric Newton method for polynomial homotopies
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Matrices in elimination theory
- Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
- Symmetric Newton polytopes for solving sparse polynomial systems
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- On the general boundary element method
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- Numerical root finding via Cox rings
- Solving determinantal systems using homotopy techniques
- Elimination for generic sparse polynomial systems
- Solving sparse non-negative tensor equations: algorithms and applications
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations
- Unmixing the mixed volume computation
- Linear programming system identification: the general nonnegative parameters case
- Applying genetic algorithms for solving nonlinear algebraic equations
- Imperialist competitive algorithm for solving systems of nonlinear equations
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
- Parametric estimation of affine deformations of planar shapes
- Minimizing multi-homogeneous Bézout numbers by a local search method
- Numerical Evidence for a Conjecture in Real Algebraic Geometry
- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
- Computing Tropical Curves via Homotopy Continuation
- Computing all space curve solutions of polynomial systems by polyhedral methods
- Perturbed homotopies for finding all isolated solutions of polynomial systems
- Regeneration homotopies for solving systems of polynomials
- Generating approximate parametric roots of parametric polynomials
- Computing isolated roots of sparse polynomial systems in affine space
- On the use of predictor-corrector continuation to trace implicitly defined curves and calculating bifurcation
- A Complete Implementation for Computing General Dimensional Convex Hulls
- Optimization problem in multi-homogeneous homotopy method
- The BKK root count in $\mathbf {C}^n$
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Computation of the distance to semi-algebraic sets
- Foreword. What is numerical algebraic geometry?
- A new hybrid algorithm based on chaotic maps for solving systems of nonlinear equations
- Toric eigenvalue methods for solving sparse polynomial systems
- A robust numerical path tracking algorithm for polynomial homotopy continuation
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- A numerical algorithm to find soft-constrained Nash equilibria in scalar LQ-games
- Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
- Exact line and plane search for tensor optimization
- High probability analysis of the condition number of sparse polynomial systems
- Deformation techniques to solve generalised Pham systems
- The Maximum Likelihood Degree of Sparse Polynomial Systems
- Numerical homotopies from Khovanskii bases
- Early Ending in Homotopy Path-Tracking for Real Roots
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems
- Polyhedral homotopies in Cox coordinates
- Bernstein's theorem in affine space
- Robust numerical algebraic geometry
- Relations between roots and coefficients, interpolation and application to system solving
- Branch points of homotopies: distribution and probability of failure
- A continuous-time perspective on global acceleration for monotone equation problems
- Linear programming system identification
- Sparse systems and algorithmic equidimensional decomposition
- Algorithms for computing Nash equilibria in deterministic LQ games
- A scaling algorithm for polynomial constraint satisfaction problems
- Algebraic \(\mathbb C^*\)-actions and the inverse kinematics of a general 6R manipulator
This page was built for publication: Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4305440)
