Exploiting structure in piecewise-linear homotopy algorithms for solving equations
From MaRDI portal
Publication:3872237
DOI10.1007/BF01588321zbMath0433.90088MaRDI QIDQ3872237
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
triangulationsmodularityspecial structurefixed-point algorithmscomputation of fixed pointssolving systems of equationspiecewise-linear homotopy algorithms
Numerical mathematical programming methods (65K05) Fixed-point and coincidence theorems (topological aspects) (54H25) Mathematical programming (90C99)
Related Items
A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm, On parametric nonlinear programming, Computation of all solutions to a system of polynomial equations, On accelerating PL continuation algorithms by predictor—corrector methods, Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of fixed points and applications
- On Piecewise Linear Approximations to Smooth Mappings
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths
- Orientation in Complementary Pivot Algorithms
- The Solution of Systems of Piecewise Linear Equations
- On triangulations for computing fixed points
- Complexity Results for Bandwidth Minimization
- A modification of todd's triangulationJ 3
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
- Efficient Acceleration Techniques for Fixed Point Algorithms
- On the homotopic approach to systems of equations with separable mappings
- Improving the convergence of fixed-point algorithms
- Homotopies for computation of fixed points on unbounded regions