June 30

This subdirectory contains the following Matlab source codes for the MFS_C problem for C being the set of r-sparse vectors and D_i being halfspaces or union of halfspaces:

run_code.m               Run_code for the case when all D_i are half spaces
proj_ls.m                Implementation of sGP_ls for solving the corresponding subproblems with log penalty function

run_code_nonconvex.m     Run_code for the case when all D_i are union half spaces
proj_ls_nonconvex.m      Implementation of sGP_ls for solving the corresponding subproblems with log penalty function

Implementation and numerical experience with the above codes are described in the paper: 
    Minglu Ye and Ting Kei Pong
    "A subgradient-based approach for finding the maximum feasible subsystem with respect to a set",
    Submitted.
This code was last updated on June 22, 2019.

Questions/comments/suggestions about the codes are welcome.  

Ting Kei Pong tk.pong@polyu.edu.hk