scientific article; zbMATH DE number 3862340

MaRDI QIDQ3330405zbMATH OpenFDO

Authors Ludo van der Heyden, Dolf Talman

Publication date 1983

zbMATH Keywords

convergencelinear complementarity problemstarting pointvariable dimension restart algorithms

Mathematics Subject Classification ID

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

Recommendations

• A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
• Iterative algorithms for the linear complementarity problem
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• scientific article; zbMATH DE number 1326028
• A potential-reduction algorithm for linear complementarity problems

Cited in

(4)

• Simplicial zero-point algorithms: A unifying description
• An algorithm for the linear complementarity problem with upper and lower bounds
• A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds

This page was built for publication:

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