A simplicial approximation of a solution for the nonlinear complementarity problem

DOI10.1007/BF01681351zbMath0358.90058OpenAlexW2020594877MaRDI QIDQ4132271

Hans-Jakob Lüthi

Publication date: 1975

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

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

Mathematics Subject Classification ID

Convex programming (90C25) Noncooperative games (91A10) Nonlinear programming (90C30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items

Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds, The octahedral algorithm, a new simplicial fixed point algorithm, Simplicial zero-point algorithms: A unifying description

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementary pivot theory of mathematical programming
• Some classes of matrices in linear complementarity theory
• Bimatrix Equilibrium Points and Mathematical Programming
• The Approximation of Fixed Points of a Continuous Mapping
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• Convex Analysis
• On the basic theorem of complementarity
• The Linear Complementarity Problem
• On Quadratic Programming
• The complementarity problem
• Homotopies for computation of fixed points on unbounded regions