A PATH-BASED APPROACH TO CONSTRAINED SPARSE OPTIMIZATION

This paper proposes a path -based approach for the minimization of a continuously differentiable function over sparse symmetric sets, which is a hard problem that exhibits a restrictiveness -hierarchy of necessary optimality conditions. To achieve the more restrictive conditions in the hierarchy, state-of-the-art algorithms require a support optimization oracle that must exactly solve the problem in smaller dimensions. The path -based approach developed in this study produces a path -based optimality condition, which is placed well in the restrictiveness -hierarchy, and a method to achieve it that does not require a support optimization oracle and, moreover, is projection -free. In the development process, new results are derived for the regularized linear minimization problem over sparse symmetric sets, which give additional means to identify optimal solutions for convex and concave objective functions. We complement our results with numerical examples.