scientific article; zbMATH DE number 4156229

MaRDI QIDQ3484658zbMATH OpenFDO

Authors Hans Kremers, Dolf Talman

Publication date 1990

zbMATH Keywords

approximate solutionboundssimplicial algorithmrestart strategypiecewise linear pathgeneralized nonlinear complementarity

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• Publication:3199208
• An algorithm for the linear complementarity problem with upper and lower bounds
• scientific article; zbMATH DE number 3898633
• Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\)

Cited in

(7)

• Upper and lower solutions for semilinear elliptic complementarity problems
• An algorithm for the linear complementarity problem with upper and lower bounds
• scientific article; zbMATH DE number 4174694 (Why is no real title available?)
• scientific article; zbMATH DE number 579399 (Why is no real title available?)
• Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds
• Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications

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 Q3484658)