A simplicial approximation of a solution for the nonlinear complementarity problem

DOI10.1007/BF01681351zbMATH Open0358.90058OpenAlexW2020594877MaRDI QIDQ4132271FDOQ4132271

Authors: 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) Nonlinear programming (90C30) Noncooperative games (91A10) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Cites Work

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

Cited In (3)

• 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

This page was built for publication: A simplicial approximation of a solution for the nonlinear complementarity problem

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