Pages that link to "Item:Q3883944"
From MaRDI portal
The following pages link to Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths (Q3883944):
Displaying 10 items.
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm (Q3326743) (← links)
- $J'$: A New Triangulation of $R^n $ (Q3330396) (← links)
- Computation of all solutions to a system of polynomial equations (Q3666603) (← links)
- A PL homotopy continuation method with the use of an odd map for the artificial level (Q3723607) (← links)
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations (Q3872237) (← links)
- The octahedral algorithm, a new simplicial fixed point algorithm (Q3930548) (← links)
- An implementation of the simplex method for linear programming problems with variable upper bounds (Q3934132) (← links)
- An efficient simplicial algorithm for computing a zero of a convex union of smooth functions (Q3956756) (← links)
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods (Q4749611) (← links)
- On the computational complexity of piecewise-linear homotopy algorithms (Q4749612) (← links)
