稀疏加组稀疏优化问题的一阶和二阶方向稳定点研究
On the First-Order and Second-Order Directional Stationary Points of Sparse Plus Group Sparse Optimization Problems
摘要: 在本文中,我们考虑一类非凸非光滑的无约束稀疏加组稀疏优化问题,其损失函数是二阶连续可微函数(可能非凸),惩罚项是稀疏惩罚与组稀疏惩罚的组合,其稀疏惩罚是ℓ1范数,组稀疏惩罚是折叠凹惩罚函数。目前,计算这类带有凸加非凸惩罚优化问题的方向稳定点的研究较少,但利用方向导数定义的方向稳定点比次微分所定义的稳定点(critical点、lifted稳定点等)能更好的刻画解的局部最优性质。因此,本文主要通过方向稳定点来刻画模型的最优性条件。首先,本文引入了一阶、二阶方向稳定点的概念,探讨了它们与问题局部解的关系。其次,给出了一阶、二阶方向导数的具体表达式,这为进一步分析和求解此类问题提供了理论基础。
Abstract: In this paper, we consider a class of nonconvex, nonsmooth and unconstrained sparse plus group sparse optimization problems, in which the loss function is a twice continuously differentiable function (possibly nonconvex), and the penalty term is a combination of sparse penalty and group sparse penalty, where the sparse penalty is a ℓ1 norm, and the group sparse penalty is a general folded concave penalty function. At present, there are few studies on the calculation of directional stationary points for this type of optimization problems with convex plus nonconvex penalties, and directional stationary points characterized by directional derivatives can better show the local optimal properties of solutions than other stationary points defined by subdifferentials (e.g. critical points, lifted stationary points, etc.). Therefore, in this paper, the optimal-ity conditions of the model are characterized by means of directional stationary points. Firstly, we introduce the concepts of first-order and second-order directional stationary points, and discuss their relations with local solutions of the problem. Secondly, the concrete expressions of the first and second order directional derivatives are given, which provide a theoretical basis for further analyzing and solving this kind of problems.
文章引用:吴青青, 彭定涛, 苏妍妍. 稀疏加组稀疏优化问题的一阶和二阶方向稳定点研究[J]. 运筹与模糊学, 2023, 13(6): 7464-7476. https://doi.org/10.12677/ORF.2023.136734

参考文献

[1] Bech, A. and Hallak, N. (2019) Optimization Problems Involving Group Sparsity Terms. Mathematical Program-ming, 178, 39-67. [Google Scholar] [CrossRef
[2] Hu, Y., Li, C. and Meng, K. (2017) Group Sparse Optimization via Lp,q Regularization. Journal of Machine Learning Research, 18, 1-52.
[3] Li, W., Bian, W. and Toh, K.-C. (2022) Difference-of-Convex Algorithms for a Class of Sparse Group L0 Regularized Optimization Problems. SIAM Journal on Optimization, 32, 1614-1641. [Google Scholar] [CrossRef
[4] Yuan, M. and Lin, Y. (2006) Model Selection and Estimation in Regression with Grouped Variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 68, 49-67. [Google Scholar] [CrossRef
[5] Bian, W. and Chen, X. (2017) Optimality and Com-plexity for Constrained Optimization Problems with Nonconvex Regularization. Mathematics of Operations Re-search, 42, 1063-1084. [Google Scholar] [CrossRef
[6] Fan, J. and Li, R. (2001) Variable Se-lection via Nonconcave Penalized Likelihood and Its Oracle Properties. Journal of the American Statistical Associ-ation, 96, 1348-1360. [Google Scholar] [CrossRef
[7] Donoho, D.L. (2006) Compressed Sensing. IEEE Transactions on Information Theory, 52, 1289-1306. [Google Scholar] [CrossRef
[8] Fan, J. and Li, R. (2006) Statistical Challenges with High Di-mensionality: Feature Selection in Knowledge Discovery. Proceedings of the International Congress of Mathema-ticians, 3, 595-622. [Google Scholar] [CrossRef
[9] Zhang, C.H. (2010) Nearly Unbiased Variable Se-lection under Minimax Concave Penalty. The Annals of Statistics, 38, 894-942. [Google Scholar] [CrossRef
[10] Ong, C.S. and An, L.T.H. (2013) Learning Sparse Classifiers with Difference of Convex Functions Algorithms. Optimization Methods and Software, 28, 830-854. [Google Scholar] [CrossRef
[11] Bian, W. and Chen, X. (2020) A Smoothing Proximal Gradient Algorithm for Nonsmooth Convex Regression with Cardinality Penalty. SIAM Journal on Numerical Analysis, 58, 858-883. [Google Scholar] [CrossRef
[12] Chen, X., Pan, L.L. and Xiu, N. (2022) So-lution Sets of Three Sparse Optimization Problems for Multivariate Regression. Journal of Global Optimization, 87, 347-371. [Google Scholar] [CrossRef
[13] Pan, L. and Chen, X. (2021) Group Sparse Op-timization for Images Recovery Using Capped Folded Concave Functions. SIAM Journal on Imaging Sciences, 14, 1-25. [Google Scholar] [CrossRef
[14] Soubies, E., Blanc-Féraud, L. and Aubert, G. (2017) A Uni-fied View of Exact Continuous Penalties for L2-L0 Minimization. SIAM Journal on Optimization, 27, 2034-2060. [Google Scholar] [CrossRef
[15] Zhang, Y., Zhang, N. and Sun, D. (2020) An Efficient Hessian Based Algorithm for Solving Large-Scale Sparse Group Lasso Problems. Mathematical Programming, 179, 223-263. [Google Scholar] [CrossRef
[16] Ahn, M., Pang, J.-S. and Xin, J. (2017) Differ-ence-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity. SIAM Journal on Optimization, 27, 1637-1665. [Google Scholar] [CrossRef
[17] Pang, J.S., Razaviyayn, M. and Alvarado, A. (2017) Computing B-Stationary Points of Nonsmooth DC Programs. Mathematics of Operations Research, 42, 95-118. [Google Scholar] [CrossRef
[18] Cui, Y., Pang, J. and Sen, B. (2018) Composite Difference-Max Programs for Modern Statistical Estimation Problems. SIAM Journal on Optimization, 28, 3344-3374. [Google Scholar] [CrossRef
[19] Peng, D. and Chen, X. (2020) Computation of Second-Order Di-rectional Stationary Points for Group Sparse Optimization. Optimization Methods and Software, 35, 348-376. [Google Scholar] [CrossRef
[20] 苏妍妍, 彭定涛. 稀疏加组稀疏优化问题的方向稳定点及其光滑化方法[J]. 应用数学进展, 2022, 11(10): 7464-7477.
[21] Rockafellar, R.T. and Wets, R.J.B. (2009) Variational Analysis. Springer Science & Business Media, Berlin.
[22] Chang, T.H., Hong, M. and Pang, J.-S. (2017) Local Minimizers and Second-Order Conditions in Composite Piecewise Programming via Directional Deriva-tives.