Active set algorithm for mathematical programs with linear complementarity constraints

From MaRDI portal





The authors propose an active set algorithm for mathematical programs with linear complementarity constraints (MPLCC). They prove that any cluster point of the sequence generated by the algorithm is a \(B\)-stationary point of MPLCC provided that the feasible set is bounded and LICQ holds. Numerical results are also presented.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Active set algorithm for mathematical programs with linear complementarity constraints

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