Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
From MaRDI portal
Publication:4749611
DOI10.1007/BF01585103zbMath0509.90070MaRDI QIDQ4749611
Kojima, Masakazu, Yoshitsugu Yamamoto
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
triangulations; Lemke's algorithm; fixed point algorithm; variable dimension algorithms; Merrill's algorithm; primal-dual pair of subdivided manifolds; solutions to nonlinear equations; unification of algorithms; Van der Laan and Talman's algorithm
90C30: Nonlinear programming
65H10: Numerical computation of solutions to systems of equations
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
54H25: Fixed-point and coincidence theorems (topological aspects)
Related Items
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, The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\), \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations, A continuous deformation algorithm for variational inequality problems on polytopes, Implementation of a continuation method for normal maps
