Simplicial zero-point algorithms: A unifying description

DOI10.1007/BF00938483zbMath0571.90075OpenAlexW2001263518MaRDI QIDQ1061618

Gerard van der Laan, Adolphus J. J. Talman

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00938483

zbMATH Keywords

stationary pointsimplicial algorithmslimiting pathsMerrill's condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Numerical methods based on nonlinear programming (49M37) Homotopy theory (55P99)

Related Items (1)

Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension 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
• A variable-dimension simplicial algorithm for antipodal fixed-point theorems
• The octahedral algorithm, a new simplicial fixed point algorithm
• Equilibrium programming:The path following approach and dynamics
• A new variable dimension algorithm for the fixed point problem
• A Modified Integer Labeling for Complementarity Algorithms
• Note on the path following approach of equilibrium programming
• A unification of the existence theorems of the nonlinear complementarity problem
• A simplicial approximation of a solution for the nonlinear complementarity problem
• Extension of the Generalized Complementarity Problem
• Computing stationary points
• A restart algorithm for computing fixed points without an extra dimension
• Approximate Labelling for Simplicial Algorithms and Two Classes of Special Subsets of the Sphere
• Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
• On the basic theorem of complementarity

This page was built for publication: Simplicial zero-point algorithms: A unifying description