Efficiency and implementation of simplicial zero point algorithms

DOI10.1007/BF02591885MaRDI QIDQ5186644zbMATH OpenFDO

Authors 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)

Recommendations

• Simplicial zero-point algorithms: A unifying description
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• Simplicial Algorithm to Find Zero Points of a Function with Special Structure on a Simplotope
• Simplicial algorithms on the simplotope
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm

Cites work

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

Cited in

(3)

• POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS
• The computation of quantity-constrained equilibria by virtual taxes
• Simplicial zero-point algorithms: A unifying description

This page was built for publication: Efficiency and implementation of simplicial zero point algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5186644)