The Solution of Systems of Piecewise Linear Equations
DOI10.1287/MOOR.1.1.1zbMATH Open0458.65056OpenAlexW2062780857MaRDI QIDQ3908415FDOQ3908415
Authors: Herbert Scarf, B. Curtis Eaves
Publication date: 1976
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://cowles.yale.edu/sites/default/files/files/pub/d03/d0390.pdf
complementarityfixed pointsconvex polyhedrapiecewise linearparametric programmingpath followingcomplementary pivot algorithms
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (56)
- An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems
- On the enumeration of subcells within hypercubes and its application to the Borsuk-Ulam theorem
- Piecewise linear paths to minimize convex functions may not be monotonic
- A variable dimension fixed point algorithm and the orientation of simplices
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- A New and Constructive Proof of the Borsuk-Ulam Theorem
- On the expected number of linear complementarity cones intersected by random and semi-random rays
- A new simple homotopy algorithm for linear programming. I
- Computation of all solutions to a system of polynomial equations
- A simplicial approach for discrete fixed point theorems
- Simulated annealing and its application to cobb-douglas economic model
- A PL homotopy for finding all the roots of a polynomial
- Regular production economies
- On the average number of steps of the simplex method of linear programming
- Complementarity in Oriented Matroids
- Constructive proofs of theorems relating to:F(x) = y, with applications
- A variable dimension algorithm for the linear complementarity problem
- A new variable dimension algorithm for the fixed point problem
- Notes on computation of Kakutani fixed points
- On the computational complexity of piecewise-linear homotopy algorithms
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- Matrices and the linear complementarity problem
- Complementary pivoting and the Hopf degree theorem
- Engineering applications of the Chow-Yorke algorithm
- Oriented Euler complexes and signed perfect matchings
- A geometrical interpretation of the without-exception feasibility of PL homotopy methods
- Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
- Computation of equilibrium values in the Baron and Ferejohn bargaining model
- The Homotopy Continuation Method: Numerically Implementable Topological Procedures
- A convergent process of price adjustment and global Newton methods
- Computing Nash equilibria by iterated polymatrix approximation
- Finding all solutions to polynomial systems and other systems of equations
- A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem
- On the geometry of paths generated by PL homotopy methods
- An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs
- Nonlinear input-output model with piecewise affine coefficients
- On the efficiency of algorithms of analysis
- A note on a theorem of Yamamuro
- Computation of equilibria in an economy with increasing returns to scale technologies
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- Computing all of the equilibria of economies with two factors of production
- Solving generalized equations via homotopies
- Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
- Foreword. What is numerical algebraic geometry?
- Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
- On generalizing shapley's index theory to labelled pseudomanifolds
- The relation between the path of centers and Smale's regularization of the linear programming problem
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations
- Homotopy techniques in linear programming
- Uniqueness of equilibrium for smooth multistage concave games
- On stable piecewise linearization and generalized algorithmic differentiation
- The fundamental theorem of algebra and complexity theory
- Parametric fixed point algorithms with applications to economic policy analysis
- Characterizing total positivity: Single vector tests via linear complementarity, sign non‐reversal and variation diminution
- Constructing pure-exchange economies with many equilibria
This page was built for publication: The Solution of Systems of Piecewise Linear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3908415)