Efficiency and implementation of simplicial zero point algorithms

DOI10.1007/BF02591885zbMath0561.65037MaRDI QIDQ5186644

Gerard van der Laan, L. P. Seelen

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

global convergencedegeneracyacceleratingsimplicial restart algorithmslexicographic pivotingsimplicial variable dimension algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10)

Related Items

The computation of quantity-constrained equilibria by virtual taxes

Cites Work

• A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
• Computational complexity of a piecewise linear homotopy algorithm
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• An improvement of fixed point algorithms by using a good triangulation
• A class of simplicial restart fixed point algorithms without an extra dimension
• The octahedral algorithm, a new simplicial fixed point algorithm
• A new variable dimension algorithm for the fixed point problem
• A Modified Integer Labeling for Complementarity Algorithms
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• Quasi-Newton Methods, Motivation and Theory
• On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
• Efficient Acceleration Techniques for Fixed Point Algorithms
• Improving the convergence of fixed-point algorithms
• Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
• Homotopies for computation of fixed points on unbounded regions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item