Tractable Continuous Approximations for Constraint Selection via Cardinality Minimization

References

• Al-Shabili AH, Feng Y, Selesnick I (2021) Sharpening sparse regularizers via smoothing. IEEE Open J. Signal Processing 2:396–409.Google Scholar
• Amaldi E, Pfetsch ME, Trotter LE Jr (2003) On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Programming 95:533–554.Google Scholar
• Bui K, Park F, Zhang S, Qi Y, Xin J (2021) Structured sparsity of convolutional neural networks via nonconvex sparse group regularization. Frontiers Appl. Math. Statist. 6:529564.Google Scholar
• Candés E, Wakin M, Boyd S (2008) Enhancing sparsity by reweighted ℓ1 minimization. J. Fourier Anal. Appl. 14(5–6):877–905.Google Scholar
• Dong H (2019) On integer and MPCC representability of affine sparsity. Oper. Res. Lett. 47(3):208–212.Google Scholar
• Ehrgott M, Güler Ç, Hamacher HW, Shao L (2010) Mathematical optimization in intensity modulated radiation therapy. Ann. Oper. Res. 175(1):309–365.Google Scholar
• Fan J, Lv J (2010) A selective overview of variable selection in high dimensional feature space. Statist. Sinica 20(1):101–148.Google Scholar
• Feng M, Mitchell J, Pang J, Waechter A, Shen X (2018) Complementarity formulations of ℓ0-norm optimization problems. Pacific J. Optim. 14(2):273–305.Google Scholar
• French K (2024) Data library. Accessed October 14, 2022, http://mba.tuck.dartmouth.edu/pages/faculty/ken.french/data_library.html.Google Scholar
• Ghate A (2023) Optimal Fractionation in Radiotherapy (Cambridge University Press, Cambridge, UK).Google Scholar
• Ho M, Sun Z, Xin J (2015) Weighted elastic net penalized mean-variance portfolio design and computation. SIAM J. Financial Math. 6(1):1220–1244.Google Scholar
• Jaffray DA (2012) Image-guided radiotherapy: From current concept to future perspectives. Nature Rev. Clinical Oncology 9(12):688–699.Google Scholar
• Jara-Moroni F, Pang JS, Wächter A (2018) A study of the difference-of-convex approach for solving linear programs with complementarity constraints. Math. Programming 169(1):221–254.Google Scholar
• Le Thi HA, Pham Dinh T (2011) On solving linear complementarity problems by DC programming and DCA. Comput. Optim. Appl. 50(3):507–524.Google Scholar
• Le Thi HA, Pham Dinh T, Le HM, Vo XT (2015) DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1):26–46.Google Scholar
• Li W, Bian W, Toh K-C (2022) Difference-of-convex algorithms for a class of sparse group ℓ0 regularized optimization problems. SIAM J. Optim. 32(3):1614–1641.Google Scholar
• Nikolova M (2000) Local strong homogeneity of a regularized estimator. SIAM J. Appl. Math. 61(2):633–658.Google Scholar
• Norton M, Mafusalov A, Uryasev S (2018) Cardinality of upper average and its application to network optimization. SIAM J. Optim. 28(2):1726–1750.Google Scholar
• Pang J-S, Razaviyayn M, Alvarado A (2017) Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1):95–118.Link, Google Scholar
• Saberian F, Ghate A, Kim M (2017) Spatiotemporally optimal fractionation in radiotherapy. INFORMS J. Comput. 29(3):422–437.Link, Google Scholar
• Sacks J, Welch WJ, Mitchell TJ, Wynn HP (1989) Design and analysis of computer experiments. Statist. Sci. 4(4):409–423.Google Scholar
• Sriperumbudur BK, Lanckriet GRG (2012) A proof of convergence of the concave-convex procedure using Zangwill’s theory. Neural Comput. 24(6):1391–1407.Google Scholar
• Tillmann AM, Bienstock D, Lodi A, Schwartz A (2024) Cardinality minimization, constraints, and regularization: A survey. SIAM Rev. 66(3):403–477.Google Scholar
• Troxell D, Ahn M, Gangammanavar H (2021) A cardinality minimization approach for security-constrained economic dispatch. IEEE Trans. Power Systems 37(5):3642–3652.Google Scholar
• Wang C, Tao M, Nagy JG, Lou Y (2021) Limited-angle CT reconstruction via the L1/L2 minimization. SIAM J. Imaging Sci. 14(2):749–777.Google Scholar
• Xie Y, Shanbhag UV (2021) Tractable ADMM schemes for computing KKT points and local minimizers for l0-minimization problems. Comput. Optim. Appl. 78(1):43–85.Google Scholar