Efficiency and implementation of simplicial zero point algorithms

DOI10.1007/BF02591885zbMATH Open0561.65037MaRDI QIDQ5186644FDOQ5186644

Authors: Gerard van der Laan, L. P. Seelen 

Publication date: 1984

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

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

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)

Cites Work

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

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)