A new variable dimension algorithm for the fixed point problem

DOI10.1007/BF02594783MaRDI QIDQ3959753zbMATH OpenFDO

Authors Yoshitsugu Yamamoto

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

fixed pointsystem of nonlinear equationssequence of subproblemspiecewise linear equationsvariable dimension algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Fixed-point and coincidence theorems (topological aspects) (54H25)

Cites work

• scientific article; zbMATH DE number 3700117 (Why is no real title available?)
• scientific article; zbMATH DE number 3728015 (Why is no real title available?)
• scientific article; zbMATH DE number 3728016 (Why is no real title available?)
• scientific article; zbMATH DE number 3535189 (Why is no real title available?)
• A Modified Integer Labeling for Complementarity Algorithms
• A class of simplicial restart fixed point algorithms without an extra dimension
• A restart algorithm for computing fixed points without an extra dimension
• A variable dimension algorithm for the linear complementarity problem
• A variable-dimension simplicial algorithm for antipodal fixed-point theorems
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• The Solution of Systems of Piecewise Linear Equations
• The computation of fixed points and applications
• The octahedral algorithm, a new simplicial fixed point algorithm
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods

Cited in

(13)

• A variable dimension fixed point algorithm and the orientation of simplices
• Solving discrete zero point problems
• A simplicial homotopy algorithm for computing zero points on polytopes
• Efficiency and implementation of simplicial zero point algorithms
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• A unifying model based on retraction for fixed point algorithms
• Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
• Computational complexity of a piecewise linear homotopy algorithm
• Simplicial zero-point algorithms: A unifying description
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
• A better triangulation for Wright's \(2^n\)-ray algorithm
• A variable-dimension homotopy on networks for computing linear spatial equilibria
• Computing an integer point of a class of convex sets.

This page was built for publication: A new variable dimension algorithm for the fixed point problem

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