eduzhai > Physical Sciences > Physics Sciences >

Sparse Solutions of Mixed Complementarity Problems

  • Save

... pages left unread,continue reading

Document pages: 13 pages

Abstract: In this paper, we consider an extragradient thresholding algorithm for finding the sparse solution of mixed complementarity problems (MCPs). We establish a relaxation l1 regularized projection minimization model for the original problem and design an extragradient thresholding algorithm (ETA) to solve the regularized model. Furthermore, we prove that any cluster point of the sequence generated by ETA is a solution of MCP. Finally, numerical experiments show that the ETA algorithm can effectively solve the l1 regularized projection minimization model and obtain the sparse solution of the mixed complementarity problem.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×