Simplicial algorithm to solve the nonlinear complementarity problem on S^ n R^ m_ +

DOI10.1007/BF00939649zbMATH Open0696.90071MaRDI QIDQ911481FDOQ911481

M. W. Hofkes

Publication date: 1990

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

Recommendations

• Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
• scientific article; zbMATH DE number 3898633
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
• The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)

zbMATH Keywords

simplicial algorithmnonlinear complementarityconvergence conditionK-triangulationV-triangulationVK-triangulation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• Simplizialzerlegungen von beschränkter Flachheit
• Title not available (Why is that?)
• A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices

Cited In (8)

• A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\)
• A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
• The \((n+1)2^ m\)-ray algorithm: A new simplicial algorithm for the variational inequality problem on \(\mathbb{R}^ m_ +\times S^ n\)
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
• Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\)

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