Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds

DOI10.1007/BF02591848zbMath0633.90082OpenAlexW2096324943MaRDI QIDQ3771993

Gerard van der Laan, Adolphus J. J. Talman

Publication date: 1987

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

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

zbMATH Keywords

triangulationlinear complementaritylower and upper boundssimplicial algorithmnonlinear complementaritysimplicial variable dimension restart algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (5)

Computing integral solutions of complementarity problems ⋮ A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices ⋮ Equilibrium in an exchange economy with multiple indivisible commodities and money ⋮ Gauss’ class number problem for imaginary quadratic fields ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

Cites Work

• Simplicial zero-point algorithms: A unifying description
• A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• A class of simplicial restart fixed point algorithms without an extra dimension
• On the number of solutions to a class of complementarity problems
• The octahedral algorithm, a new simplicial fixed point algorithm
• A new variable dimension algorithm for the fixed point problem
• A simplicial algorithm for the nonlinear complementarity problem
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• A simplicial approximation of a solution for the nonlinear complementarity problem
• On a Direct Algorithm for Nonlinear Complementarity Problems
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Improving the convergence of fixed-point algorithms
• Solving the Nonlinear Complementarity Problem by a Homotopy Method
• A restart algorithm for computing fixed points without an extra dimension
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
• Some classes of matrices in linear complementarity theory
• On the basic theorem of complementarity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds