A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm

DOI10.1007/BF02612336zbMath0539.65036OpenAlexW2005252069MaRDI QIDQ3326743

Kojima, Masakazu, Yoshitsugu Yamamoto

Publication date: 1984

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

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

zbMATH Keywords

numerical comparisonsimplementationhomotopy methodscomplementary pivotingvariable dimension algorithmsrestart fixed point algorithmssimplicial restart algorithms

Mathematics Subject Classification ID

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

Related Items

The existence and computation of competitive equilibria in markets with an indivisible commodity, A simplicial homotopy algorithm for computing zero points on polytopes, Remarks on endpoints of multivalued mappings in geodesic spaces, Some hybrid fixed point theorems related to optimization, A better triangulation for Wright's \(2^n\)-ray algorithm, Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds, A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form, On Finding Large Sets of Rewards in Two-Player ETP–ESP Games, A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications, Scaled optimal path trust-region algorithm, Simplicial zero-point algorithms: A unifying description, A variable dimension fixed point algorithm and the orientation of simplices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computation of fixed points and applications
• A search routine for a Sperner simplex
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• Exploiting structure in piecewise-linear homotopy algorithms for solving equations
• Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths
• 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
• A new variable dimension algorithm for the fixed point problem
• A Modified Integer Labeling for Complementarity Algorithms
• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• A restart algorithm for computing fixed points without an extra dimension
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
• Conjugate Directions without Linear Searches