Author:
Wang Chunyan,Wang Wenjie,Li Mengzhen
Abstract
AbstractIn this paper, we transform the classical linear discriminant analysis (LDA) into a smooth difference-of-convex optimization problem. Then, a new difference-of-convex algorithm with extrapolation is introduced and the convergence of the algorithm is established. Finally, for a face recognition problem, the proposed algorithm achieves better classification performance compared with several current algorithms in the literature.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference13 articles.
1. Fukunaga, K.: Introduction to Statistical Pattern Recognition, 2nd edn. Academic Press, New York (1991)
2. Guo, Y., Hastie, T., Tibshirani, R.: Regularized discriminant analysis and its application in microarrays. Pattern Recognit. 8(1), 86–100 (2003)
3. Huang, R., Liu, C., Zhou, J.: Discriminant analysis via jointly $L_{2,1}$-norm sparse tensor preserving embedding for image classification. J. Vis. Commun. Image Represent. 47, 10–22 (2017)
4. Le Thi, H.A., Pham Dinh, T., Muu, L.D.: Numerical solution for optimization over the efficient set by D.C. optimization algorithms. Oper. Res. Lett. 19(3), 117–128 (1996)
5. Li, C.N., Shao, Y.H., Yin, W., Liu, M.Z.: Robust and sparse linear discriminant analysis via an alternating direction method of multipliers. IEEE Trans. Neural Netw. Learn. Syst. 31(3), 915–926 (2019)