期刊
SIAM JOURNAL ON OPTIMIZATION
卷 30, 期 2, 页码 1274-1299出版社
SIAM PUBLICATIONS
DOI: 10.1137/18M1186320
关键词
maximum feasible subsystem; subgradient methods; Kurdyka-Lojasiewicz property
资金
- Natural Science Foundation of China [11871359]
- Hong Kong Research Grants Council [PolyU153005/17p]
We propose a subgradient-based method for finding the maximum feasible subsystem in a collection of closed sets with respect to a given closed set C (MFSC). In this method, we reformulate the MFSC problem as an l(0) optimization problem and construct a sequence of continuous optimization problems to approximate it. The objective of each approximation problem is the sum of the composition of a nonnegative non-decreasing continuously differentiable concave function with the squared distance function to a closed set. Although this objective function is non-smooth in general, a subgradient can be obtained in terms of the projections onto the closed sets. Based on this observation, we adapt a subgradient projection method to solve these approximation problems. Unlike classical subgradient methods, the convergence (clustering to stationary points) of our subgradient method is guaranteed with a nondiminishing stepsize under mild assumptions. This allows us to further study the sequential convergence of the subgradient method under suitable Kurdyka-Lojasiewicz assumptions. Finally, we illustrate our algorithm numerically for solving the MFSC problems on a collection of halfspaces and a collection of unions of halfspaces, respectively, with respect to the set of s-sparse vectors.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据