A dual exact penalty formulation for the linear complementarity problem
From MaRDI portal
We consider a dual exact penalty formulation for the monotone linear complementarity problem. Tihonov regularization is then used to reduce the solution of the problem to the solution of a sequence of positive- definite, symmetric quadratic programs. A modified form of an SOR method due to Mangasarian is proposed to solve these quadratic programs. We also indicate how to obtain approximation solutions to predefined tolerance by solving a single quadratic program, in special cases.
Recommendations
Cites work
- A dual differentiable exact penalty function
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- Simple bounds for solutions of monotone complementarity problems and convex programs
- Solution of symmetric linear complementarity problems by iterative methods
- Solving the Linear Complementarity Problem in Circuit Simulation
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(4)
This page was built for publication: A dual exact penalty formulation for the linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093553)