https://orcid.org/0000-0002-3172-2028
References
- Chancelier J-P, De Lara M. Hidden convexity in the l0 pseudonorm. J Convex Anal. 2021;28(1):203–236.
- Chancelier J-P, De Lara M. Constant along primal rays conjugacies and the l0 pseudonorm. Optimization. 2022;71(2):355–386.
- Chancelier J-P, De Lara M. Capra-convexity, convex factorization and variational formulations for the l0 pseudonorm. Set-Valued Variational Anal. 2022;30:597–619.
- Le HY. Generalized subdifferentials of the rank function. Opt Lett. 2013;7(4):731–743.
- Singer I. Abstract convex analysis. In: Canadian mathematical society series of monographs and advanced texts. New York: John Wiley & Sons, Inc.; 1997. ISBN 0-471-16015-6.
- Martínez-Legaz JE. Generalized convex duality and its economic applications. In: Hadjisavvas N, Komlósi S, Schaible S, editors. Handbook of generalized convexity and generalized monotonicity. Nonconvex optimization and its applications, Vol. 76. New York (NY): Springer-Verlag; 2005. p. 237–292.
- McDonald AM, Pontil M, Stamos D. New perspectives on k-support and cluster norms. J Mach Learn Res. 2016;17(155):1–38.
- Hiriart-Urruty J-B, Lemaréchal C. Fundamentals of convex analysis. Springer;2004.
- Qu Q, Sun J, Wright J. Finding a sparse vector in a subspace: linear sparsity using alternating directions. IEEE Trans Inf Theory. 2016;62(10):5855–5880.
- Soubies E, Blanc-Féraud L, Aubert G. A continuous exact l0 penalty (CEL0) for least squares regularized problem. SIAM J Imaging Sci. 2015;8(3):1607–1639.
- Wen F, Chu L, Liu P, et al. A survey on nonconvex regularization-based sparse and low-rank recovery in signal processing, statistics, and machine learning. IEEE Access. 2018;6:69883–69906.