Efficiency and implementation of simplicial zero point algorithms

This publication has 18 references indexed in Scilit:

• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
  Mathematical Programming, 1982
• A class of simplicial restart fixed point algorithms without an extra dimension
  Mathematical Programming, 1981
• A Modified Integer Labeling for Complementarity Algorithms
  Mathematics of Operations Research, 1981
• An improvement of fixed point algorithms by using a good triangulation
  Mathematical Programming, 1980
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
  SIAM Review, 1980
• A restart algorithm without an artificial level for computing fixed points on unbounded regions
  Lecture Notes in Mathematics, 1979
• Improving the convergence of fixed-point algorithms
  Published by Springer Nature ,1978
• Quasi-Newton Methods, Motivation and Theory
  SIAM Review, 1977
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
  SIAM Journal on Numerical Analysis, 1976
• Homotopies for computation of fixed points on unbounded regions
  Mathematical Programming, 1972