Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods

DOI10.1007/BF01585103zbMath0509.90070OpenAlexW2050957891MaRDI QIDQ4749611

Kojima, Masakazu, Yoshitsugu Yamamoto

Publication date: 1982

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

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

zbMATH Keywords

triangulationsLemke's algorithmfixed point algorithmvariable dimension algorithmsMerrill's algorithmprimal-dual pair of subdivided manifoldssolutions to nonlinear equationsunification of algorithmsVan der Laan and Talman's algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Fixed-point and coincidence theorems (topological aspects) (54H25)

Related Items (20)

A variable-dimension homotopy on networks for computing linear spatial equilibria ⋮ A continuous deformation algorithm for variational inequality problems on polytopes ⋮ Implementation of a continuation method for normal maps ⋮ Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds ⋮ A variable rate refining triangulation ⋮ The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria ⋮ Rational biparameter homotopy perturbation method and Laplace-Padé coupled version ⋮ Modified HPMs inspired by homotopy continuation methods ⋮ A unifying model based on retraction for fixed point algorithms ⋮ The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm ⋮ Computing an integer point of a class of convex sets. ⋮ Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron ⋮ The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\) ⋮ Simplicial zero-point algorithms: A unifying description ⋮ \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations ⋮ A new variable dimension algorithm for the fixed point problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computation of fixed points and applications
• Complementary pivot theory of mathematical programming
• 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 Solution of Systems of Piecewise Linear Equations
• The octahedral algorithm, a new simplicial fixed point algorithm
• A Modified Integer Labeling for Complementarity Algorithms
• Studies on Piecewise-Linear Approximations of Piecewise-C¹ Mappings in Fixed Points and Complementarity Theory
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points
• Equilibrium Points of Bimatrix Games
• The Approximation of Fixed Points of a Continuous Mapping
• Homotopies for computation of fixed points on unbounded regions

This page was built for publication: Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods