{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:14:48Z","timestamp":1757618088057,"version":"3.44.0"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:00:00Z","timestamp":1748908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T00:00:00Z","timestamp":1748908800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper we present an efficient active-set method for the solution of convex quadratic programming problems with general piecewise-linear terms in the objective, with applications to sparse approximations and risk-minimization. The algorithm is derived by combining a proximal method of multipliers (PMM) with a standard semismooth Newton method (SSN), and is shown to be globally convergent under minimal assumptions. Further local linear (and potentially superlinear) convergence is shown under standard additional conditions. The major computational bottleneck of the proposed approach arises from the solution of the associated SSN linear systems. These are solved using a Krylov-subspace method, accelerated by certain novel general-purpose preconditioners which are shown to be optimal with respect to the proximal penalty parameters. The preconditioners are easy to store and invert, since they exploit the structure of the nonsmooth terms appearing in the problem\u2019s objective to significantly reduce their memory requirements. We showcase the efficiency, robustness, and scalability of the proposed solver on a variety of problems arising in risk-averse portfolio selection, <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$L^1$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>L<\/mml:mi>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>-regularized partial differential equation constrained optimization, quantile regression, and binary classification via linear support vector machines. We provide computational evidence, on real-world datasets, to demonstrate the ability of the solver to efficiently and competitively handle a diverse set of medium- and large-scale optimization instances.<\/jats:p>","DOI":"10.1007\/s10915-025-02933-x","type":"journal-article","created":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T03:02:24Z","timestamp":1748919744000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Active-Set method With Applications to Sparse Approximations and Risk Minimization"],"prefix":"10.1007","volume":"104","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7903-9335","authenticated-orcid":false,"given":"Spyridon","family":"Pougkakiotis","sequence":"first","affiliation":[]},{"given":"Jacek","family":"Gondzio","sequence":"additional","affiliation":[]},{"given":"Dionysis","family":"Kalogerias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,3]]},"reference":[{"key":"2933_CR1","unstructured":"Bertsekas, D.P., Nedic, A., Ozdaglar, E.: Convex Analysis and Optimization. Athena Scientific (2003)"},{"key":"2933_CR2","doi-asserted-by":"publisher","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Review 43(1), 129\u2013159 (2001). https:\/\/doi.org\/10.1137\/S003614450037906X","DOI":"10.1137\/S003614450037906X"},{"issue":"4","key":"2933_CR3","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/21M1401103","volume":"64","author":"V De Simone","year":"2022","unstructured":"De Simone, V., di Serafino, D., Gondzio, J., Pougkakiotis, S., Viola, M.: Sparse approximations with interior point methods. SIAM Review 64(4), 954\u2013988 (2022). https:\/\/doi.org\/10.1137\/21M1401103","journal-title":"SIAM Review"},{"key":"2933_CR4","volume-title":"Statistical Learning Theory","author":"VN Vapnik","year":"1998","unstructured":"Vapnik, V.N.: Statistical Learning Theory. John Wiley & Sons, New York (1998)"},{"issue":"2","key":"2933_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 67(2), 301\u2013320 (2005). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00503.x","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"issue":"2","key":"2933_CR6","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.jbankfin.2005.04.012","volume":"30","author":"S Alexander","year":"2006","unstructured":"Alexander, S., Coleman, T.F., Li, Y.: Minimizing CVaR and VaR for a portfolio of derivatives. Journal of Banking & Finance 30(2), 583\u2013605 (2006). https:\/\/doi.org\/10.1016\/j.jbankfin.2005.04.012","journal-title":"Journal of Banking & Finance"},{"issue":"3","key":"2933_CR7","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1051\/cocv\/2010027","volume":"17","author":"G Wachsmuth","year":"2011","unstructured":"Wachsmuth, G., Wachsmuth, D.: Convergence and regularization results for optimal control problems with sparsity functional. ESAIM: Control, Optimisation and Calculus of Variations 17(3), 858\u2013886 (2011). https:\/\/doi.org\/10.1051\/cocv\/2010027","journal-title":"ESAIM: Control, Optimisation and Calculus of Variations"},{"issue":"3","key":"2933_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1111\/1467-9965.00100","volume":"10","author":"D Li","year":"2000","unstructured":"Li, D., Ng, W.L.: Optimal dynamic portfolio selection: Multiperiod mean-variance formulation. Mathematical Finance 10(3), 387\u2013406 (2000). https:\/\/doi.org\/10.1111\/1467-9965.00100","journal-title":"Mathematical Finance"},{"issue":"3","key":"2933_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. Journal of Risk 2(3), 21\u201341 (2000). https:\/\/doi.org\/10.21314\/JOR.2000.038","journal-title":"Journal of Risk"},{"key":"2933_CR10","doi-asserted-by":"publisher","unstructured":"Silva, L.P., Alem, D., Carvalho, F.L.: Portfolio optimization using mean absolute deviation (MAD) and conditional value-at-risk (CVaR). Production 27 (2017). https:\/\/doi.org\/10.1590\/0103-6513.208816","DOI":"10.1590\/0103-6513.208816"},{"key":"2933_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01585997","volume":"71","author":"JV Burke","year":"1995","unstructured":"Burke, J.V., Ferris, M.C.: A Gauss-Newton method for convex composite optimization. Mathematical Programming 71, 179\u2013194 (1995). https:\/\/doi.org\/10.1007\/BF01585997","journal-title":"Mathematical Programming"},{"key":"2933_CR12","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BF01581047","volume":"22","author":"R Lazimy","year":"1982","unstructured":"Lazimy, R.: Mixed-integer quadratic programming. Mathematical Programming 22, 332\u2013349 (1982). https:\/\/doi.org\/10.1007\/BF01581047","journal-title":"Mathematical Programming"},{"key":"2933_CR13","doi-asserted-by":"publisher","unstructured":"Beck, A.: First-Order Methods in Optimization. MOS-SIAM Series on Optimization. SIAM & Mathematical Optimization Society, Philadelphia (2017). https:\/\/doi.org\/10.1137\/1.9781611974997","DOI":"10.1137\/1.9781611974997"},{"key":"2933_CR14","doi-asserted-by":"publisher","unstructured":"Deng, W., Yin, W.: On the global and linear convergence of the generalized alternating direction method of multipliers. Journal of Scientific Computing 66, 889\u2013916 (2016). https:\/\/doi.org\/10.1007\/s10915-015-0048X","DOI":"10.1007\/s10915-015-0048X"},{"key":"2933_CR15","doi-asserted-by":"publisher","unstructured":"Han, S.P., Pang, J.S., Rangaraj, N.: Globally convergent Newton methods for nonsmooth equations. Mathematics of Operations Research 17(3), 586\u2013607 (1992). https:\/\/doi.org\/10.1287\/moor.17.3.586","DOI":"10.1287\/moor.17.3.586"},{"issue":"1\u20132","key":"2933_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0377-0427(94)00088-I","volume":"60","author":"J Mart\u00ednez","year":"1995","unstructured":"Mart\u00ednez, J., Qi, L.: Inexact Newton methods for solving nonsmooth equations. Journal of Computational and Applied Mathematics 60(1\u20132), 127\u2013145 (1995). https:\/\/doi.org\/10.1016\/0377-0427(94)00088-I","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"2933_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward-backward quasi-Newton methods for nonsmooth optimization problems. Computational Optimization and Applications 67, 443\u2013487 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9912-y","journal-title":"Computational Optimization and Applications"},{"key":"2933_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-021-00342-y","author":"A De Marchi","year":"2022","unstructured":"De Marchi, A.: On a primal-dual Newton proximal method for convex quadratic programs. Computational Optimization and Applications (2022). https:\/\/doi.org\/10.1007\/s10589-021-00342-y","journal-title":"Computational Optimization and Applications"},{"key":"2933_CR19","doi-asserted-by":"publisher","unstructured":"Dhingra, N.K., Khong, S.Z., Jovanovi\u0107, M.R.: A second order primal-dual algorithm for nonsmooth convex composite optimization. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 2868\u20132873 (2017). https:\/\/doi.org\/10.1109\/CDC.2017.8264075","DOI":"10.1109\/CDC.2017.8264075"},{"key":"2933_CR20","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s12532-022-00218-0","volume":"14","author":"B Hermans","year":"2022","unstructured":"Hermans, B., Themelis, A., Patrinos, P.: QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs. Mathematical Programming Computation 14, 497\u2013541 (2022). https:\/\/doi.org\/10.1007\/s12532-022-00218-0","journal-title":"Mathematical Programming Computation"},{"issue":"3","key":"2933_CR21","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM Journal on Optimization 24(3), 1420\u20131443 (2014). https:\/\/doi.org\/10.1137\/130921428","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"2933_CR22","doi-asserted-by":"publisher","first-page":"2410","DOI":"10.1137\/19M1251795","volume":"30","author":"X Li","year":"2020","unstructured":"Li, X., Sun, D., Toh, K.C.: An asymptotically superilinearly convergent semismooth Newton augmented Lagrangian method for linear programming. SIAM Journal on Optimization 30(3), 2410\u20132440 (2020). https:\/\/doi.org\/10.1137\/19M1251795","journal-title":"SIAM Journal on Optimization"},{"key":"2933_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-013-0063-6","volume":"6","author":"K Fountoulakis","year":"2014","unstructured":"Fountoulakis, K., Gondzio, J., Zhlobich, P.: Matrix-free interior point method for compressed sensing problems. Mathematical Programming Computation 6, 1\u201331 (2014). https:\/\/doi.org\/10.1007\/s12532-013-0063-6","journal-title":"Mathematical Programming Computation"},{"key":"2933_CR24","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10589-022-00424-5","volume":"83","author":"J Gondzio","year":"2022","unstructured":"Gondzio, J., Pougkakiotis, S., Pearson, J.W.: General-purpose preconditioning for regularized interior point methods. Computational Optimization and Applications 83, 727\u2013757 (2022). https:\/\/doi.org\/10.1007\/s10589-022-00424-5","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"2933_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2276","volume":"27","author":"JW Pearson","year":"2019","unstructured":"Pearson, J.W., Porcelli, M., Stoll, M.: Interior-point methods and preconditioning for PDE-constrained optimization problems involving sparsity terms. Numerical Linear Algebra with Applications 27(2), e2276 (2019). https:\/\/doi.org\/10.1002\/nla.2276","journal-title":"Numerical Linear Algebra with Applications"},{"key":"2933_CR26","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/nla.673","volume":"17","author":"J Chen","year":"2010","unstructured":"Chen, J., Qi, L.: Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations. Numerical Linear Algebra with Applications 17, 155\u2013174 (2010). https:\/\/doi.org\/10.1002\/nla.673","journal-title":"Numerical Linear Algebra with Applications"},{"key":"2933_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-010-9339-1","volume":"15","author":"PE Gill","year":"2012","unstructured":"Gill, P.E., Robinson, D.P.: A primal-dual augmented Lagrangian. Computational Optimization and Applications 15, 1\u201325 (2012). https:\/\/doi.org\/10.1007\/s10589-010-9339-1","journal-title":"Computational Optimization and Applications"},{"key":"2933_CR28","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10107-007-0196-3","volume":"118","author":"K Ito","year":"2009","unstructured":"Ito, K., Kunnisch, K.: On a semi-smooth Newton method and its globalization. Mathematical Programming 118, 347\u2013370 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0196-3","journal-title":"Mathematical Programming"},{"key":"2933_CR29","doi-asserted-by":"publisher","unstructured":"Hans, E., Raasch, T.: Global convergence of damped semismooth Newton methods for $$\\ell _1$$ Tikhonov regularization. Inverse Problems 31, 025,005 (2015). https:\/\/doi.org\/10.1088\/0266-5611\/31\/2\/025005","DOI":"10.1088\/0266-5611\/31\/2\/025005"},{"issue":"1","key":"2933_CR30","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM Journal on Optimization 28(1), 433\u2013458 (2018). https:\/\/doi.org\/10.1137\/16M1097572","journal-title":"SIAM Journal on Optimization"},{"key":"2933_CR31","doi-asserted-by":"publisher","first-page":"2087","DOI":"10.1007\/s11081-020-09523-w","volume":"22","author":"F Mannel","year":"2021","unstructured":"Mannel, F., Rund, A.: A hybrid semismooth quasi-Newton method for nonsmooth optimal control with PDEs. Optimization and Engineering 22, 2087\u20132125 (2021). https:\/\/doi.org\/10.1007\/s11081-020-09523-w","journal-title":"Optimization and Engineering"},{"issue":"5","key":"2933_CR32","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1016\/j.camwa.2017.04.033","volume":"74","author":"M Porcelli","year":"2017","unstructured":"Porcelli, M., Simoncini, V., Stoll, M.: Preconditioning PDE-constrained optimization with $$l^1$$-sparsity and control constraints. Computers & Mathematics with Applications 74(5), 1059\u20131075 (2017). https:\/\/doi.org\/10.1016\/j.camwa.2017.04.033","journal-title":"Computers & Mathematics with Applications"},{"key":"2933_CR33","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1137\/18M1164925","volume":"30","author":"C Christof","year":"2020","unstructured":"Christof, C., De Los Reyes, H.C., Meyer, C.: A nonsmooth trust-region method for locally Lipschitz functions with applications to optimization problems constrained by variational inequalities. SIAM Journal on Optimization 30, 2163\u20132196 (2020). https:\/\/doi.org\/10.1137\/18M1164925","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"2933_CR34","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: Further properties and nonmonotone linesearch algorithms. SIAM Journal on Optimization 28(3), 2274\u20132303 (2018). https:\/\/doi.org\/10.1137\/16M1080240","journal-title":"SIAM Journal on Optimization"},{"key":"2933_CR35","doi-asserted-by":"publisher","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Mathematics of Operations Research 1(2), 97\u2013116 (1976). https:\/\/doi.org\/10.1287\/moor.1.2.97","DOI":"10.1287\/moor.1.2.97"},{"issue":"5","key":"2933_CR36","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization 14(5), 877\u2013898 (1976). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM Journal on Control and Optimization"},{"key":"2933_CR37","doi-asserted-by":"publisher","unstructured":"Bergamaschi, L., Gondzio, J., Mart\u00ednez, A., Pearson, J.W., Pougkakiotis, S.: A new preconditioning approach for an interior point-proximal method of multipliers for linear and convex quadratic programming. Numerical Linear Algebra with Applications 28(4), e2361 (2021). https:\/\/doi.org\/10.1002\/nla.2361","DOI":"10.1002\/nla.2361"},{"key":"2933_CR38","doi-asserted-by":"publisher","unstructured":"Waltz, R.A., Morales, J.L., Nocedal, J., Orban, D.: An interior algorithm for nonlinear optimization that combines line search and trust region steps. Mathematical Programming 107(3, Ser. A), 391\u2013408 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0560-5","DOI":"10.1007\/s10107-004-0560-5"},{"issue":"4","key":"2933_CR39","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D.F., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM Journal on Optimization 20(4), 1737\u20131765 (2010). https:\/\/doi.org\/10.1137\/080718206","journal-title":"SIAM Journal on Optimization"},{"key":"2933_CR40","doi-asserted-by":"publisher","unstructured":"Wang, C., Tang, P.: A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems. Journal of Scientific Computing 96 (2023). https:\/\/doi.org\/10.1007\/s10915-023-02271-w","DOI":"10.1007\/s10915-023-02271-w"},{"key":"2933_CR41","unstructured":"Lin, M., Sun, D., Toh, K.C., Wang, C.: Estimation of sparse Gaussian graphical models with hidden clustering structure. Journal of Machine Learning Research 25(256), 1\u201336 (2024). http:\/\/jmlr.org\/papers\/v25\/20-354.html"},{"key":"2933_CR42","doi-asserted-by":"publisher","unstructured":"Patrinos, P., Bemporad, A.: Proximal Newton methods for convex composite optimization. In: 52nd IEEE Conference on Decision and Control, pp. 2358\u20132363 (2013). https:\/\/doi.org\/10.1109\/CDC.2013.6760233","DOI":"10.1109\/CDC.2013.6760233"},{"key":"2933_CR43","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10589-020-00240-9","volume":"78","author":"S Pougkakiotis","year":"2021","unstructured":"Pougkakiotis, S., Gondzio, J.: An interior point-proximal method of multipliers for convex quadratic programming. Computational Optimization and Applications 78, 307\u2013351 (2021). https:\/\/doi.org\/10.1007\/s10589-020-00240-9","journal-title":"Computational Optimization and Applications"},{"issue":"4","key":"2933_CR44","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s12532-020-00179-2","volume":"12","author":"B Stellato","year":"2020","unstructured":"Stellato, B., Banjac, G., Goulart, P., Bemporad, A., Boyd, S.: OSQP: an operator splitting solver for quadratic programs. Mathematical Programming Computation 12(4), 637\u2013672 (2020). https:\/\/doi.org\/10.1007\/s12532-020-00179-2","journal-title":"Mathematical Programming Computation"},{"key":"2933_CR45","unstructured":"Pougkakiotis, S., Gondzio, J., Kalogerias, D.: An active-set method for sparse approximations. Part I: Separable $$\\ell _1$$ terms. arXiv:2201.10211v2 (2023)"},{"key":"2933_CR46","unstructured":"Pougkakiotis, S., Gondzio, J., Kalogerias, D.: An active-set method for sparse approximations. Part II: General piecewise-linear terms. arXiv:2302.14497v1 (2023)"},{"key":"2933_CR47","doi-asserted-by":"publisher","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, Grundlehren der mathematischen Wissenschaften, vol. 317. Springer-Verlag Berlin Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-642-02431-3","DOI":"10.1007\/978-3-642-02431-3"},{"key":"2933_CR48","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10589-023-00519-7","volume":"87","author":"RT Rockafellar","year":"2024","unstructured":"Rockafellar, R.T.: Generalizations of the proximal method of multipliers in convex optimization. Computational Optimization and Applications 87, 219\u2013247 (2024)","journal-title":"Computational Optimization and Applications"},{"key":"2933_CR49","doi-asserted-by":"publisher","unstructured":"Robinson, S.M.: Some continuity properties of polyhedral multifunctions. In: H.\u00a0K\u00f6nig, B.\u00a0Korte, K.\u00a0Ritter (eds.) Mathematical Programming at Oberwolfach, Mathematical Programming Studies, vol.\u00a014, pp. 206\u2013214. Springer, Berlin, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0120929","DOI":"10.1007\/BFb0120929"},{"key":"2933_CR50","doi-asserted-by":"publisher","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY (2014). https:\/\/doi.org\/10.1007\/978-1-4939-1037-3","DOI":"10.1007\/978-1-4939-1037-3"},{"key":"2933_CR51","doi-asserted-by":"publisher","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. Classics in Applied Mathematics. John Wiley and Sons, New York (1990). https:\/\/doi.org\/10.1137\/1.9781611971309","DOI":"10.1137\/1.9781611971309"},{"key":"2933_CR52","unstructured":"Clason, C., Valkonen, T.: Introduction to Nonsmooth Analysis and Optimization. arXiv:2001.00216v4 (2023)"},{"issue":"1","key":"2933_CR53","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0805005","volume":"5","author":"RJ Vanderbei","year":"1993","unstructured":"Vanderbei, R.J.: Symmetric quasidefinite matrices. SIAM Journal on Optimization 5(1), 100\u2013113 (1993). https:\/\/doi.org\/10.1137\/0805005","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"2933_CR54","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/0712047","volume":"12","author":"CC Paige","year":"1975","unstructured":"Paige, C.C., Saunders, M.A.: Solution of sparse indefinite systems of linear equations. SIAM Journal on Numerical Analysis 12(4), 617\u2013629 (1975). https:\/\/doi.org\/10.1137\/0712047","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"1","key":"2933_CR55","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2307\/2975974","volume":"7","author":"HM Markowitz","year":"1952","unstructured":"Markowitz, H.M.: Portfolio selection. The Journal of Finance 7(1), 77\u201391 (1952). https:\/\/doi.org\/10.2307\/2975974","journal-title":"The Journal of Finance"},{"issue":"2","key":"2933_CR56","doi-asserted-by":"publisher","first-page":"43","DOI":"10.21314\/JOR.2002.057","volume":"4","author":"P Krokhmal","year":"2002","unstructured":"Krokhmal, P., Uryasev, S., Palmquist, J.: Portfolio optimization with conditional value-at-risk objective and constraints. Journal of Risk 4(2), 43\u201368 (2002). https:\/\/doi.org\/10.21314\/JOR.2002.057","journal-title":"Journal of Risk"},{"issue":"2","key":"2933_CR57","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.ejor.2017.01.005","volume":"260","author":"KT Lwin","year":"2017","unstructured":"Lwin, K.T., Qu, R., MacCarthy, B.L.: Mean-VaR portfolio optimization: A nonparametric approach. European Journal of Operational Research 260(2), 751\u2013766 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.01.005","journal-title":"European Journal of Operational Research"},{"key":"2933_CR58","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10107-006-0721-9","volume":"108","author":"RT Rockafellar","year":"2006","unstructured":"Rockafellar, R.T., Uryasev, S., Zabarankin, M.: Optimality conditions in portfolio analysis with general deviation measures. Mathematical Programming 108, 515\u2013540 (2006). https:\/\/doi.org\/10.1007\/s10107-006-0721-9","journal-title":"Mathematical Programming"},{"key":"2933_CR59","doi-asserted-by":"publisher","unstructured":"Gilbert, E., Meiklejohn, L.: A comparative analysis of risk measures: A portfolio optimisation approach. Investment Analysts Journal 48(3) (2019). https:\/\/doi.org\/10.1080\/10293523.2019.1643128","DOI":"10.1080\/10293523.2019.1643128"},{"key":"2933_CR60","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4141301","author":"H Ramos","year":"2022","unstructured":"Ramos, H., Righi, M., Guedes, C., M\u00fcller, F.: A comparison of risk measures for portfolio optimization with cardinality constraints (2022). https:\/\/doi.org\/10.2139\/ssrn.4141301","journal-title":"A comparison of risk measures for portfolio optimization with cardinality constraints"},{"key":"2933_CR61","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.frl.2017.07.013","volume":"24","author":"MB Righi","year":"2018","unstructured":"Righi, M.B., Borenstein, D.: A simulation comparison of risk measures for portfolio optimization. Finance Research Letters 24, 105\u2013112 (2018). https:\/\/doi.org\/10.1016\/j.frl.2017.07.013","journal-title":"Finance Research Letters"},{"issue":"3","key":"2933_CR62","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1111\/1468-036X.00125","volume":"6","author":"P Jorion","year":"2000","unstructured":"Jorion, P.: Risk management lessons from long-term capital management. European Financial Management 6(3), 277\u2013300 (2000). https:\/\/doi.org\/10.1111\/1468-036X.00125","journal-title":"European Financial Management"},{"key":"2933_CR63","doi-asserted-by":"publisher","unstructured":"Boyd, S., Busseti, E., Diamond, S., N., K.R., Koh, K., Nystrup, P., Speth, J.: Multi-period trading via convex optimization. Foundations and Trends\u00aein Optimization 3(1), 1\u201376 (2017). https:\/\/doi.org\/10.1561\/2400000023","DOI":"10.1561\/2400000023"},{"key":"2933_CR64","doi-asserted-by":"publisher","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. MOS-SIAM Series on Optimization. SIAM & Mathematical Optimization Society, Philadelphia (2009). https:\/\/doi.org\/10.1137\/1.9780898718751","DOI":"10.1137\/1.9780898718751"},{"issue":"5","key":"2933_CR65","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1287\/mnsc.37.5.519","volume":"37","author":"H Konno","year":"1991","unstructured":"Konno, H., Yamazaki, H.: Mean-absolute deviation portfolio optimization model and its applications to Tokyo stock market. Management Science 37(5), 519\u2013531 (1991). https:\/\/doi.org\/10.1287\/mnsc.37.5.519","journal-title":"Management Science"},{"key":"2933_CR66","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1016\/j.dib.2016.06.031","volume":"8","author":"R Bruni","year":"2016","unstructured":"Bruni, R., Cesarone, F., Scozzari, A., Tardella, F.: Real-world datasets for portfolio selection and solutions of some stochastic dominance portfolio models. Data in Brief 8, 858\u2013862 (2016). https:\/\/doi.org\/10.1016\/j.dib.2016.06.031","journal-title":"Data in Brief"},{"issue":"3","key":"2933_CR67","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner, P., Delbaen, F., Eber, J.M., Heath, D.: Coherent measures of risk. Mathematical Finance 9(3), 203\u2013228 (1999). https:\/\/doi.org\/10.1111\/1467-9965.00068","journal-title":"Mathematical Finance"},{"issue":"2","key":"2933_CR68","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1236463.1236469","volume":"33","author":"HC Elman","year":"2007","unstructured":"Elman, H.C., Ramage, A., Silvester, D.J.: Algorithm 866: IFISS, a Matlab toolbox for modelling incompressible flow. ACM Transactions on Mathematical Software 33(2), 14 (2007). https:\/\/doi.org\/10.1145\/1236463.1236469","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"2","key":"2933_CR69","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/120891393","volume":"52","author":"HC Elman","year":"2014","unstructured":"Elman, H.C., Ramage, A., Silvester, D.J.: IFISS: A computational laboratory for investigating incompressible flow problems. SIAM Review 52(2), 261\u2013273 (2014). https:\/\/doi.org\/10.1137\/120891393","journal-title":"SIAM Review"},{"key":"2933_CR70","doi-asserted-by":"publisher","unstructured":"Tr\u00f6ltzsch, F.: Optimal Control of Partial Differential Equations: Theory, Methods and Applications, Graduate Studies in Mathematics, vol. 112. American Mathematical Society (2010). https:\/\/doi.org\/10.1090\/gsm\/112","DOI":"10.1090\/gsm\/112"},{"key":"2933_CR71","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10589-017-9951-4","volume":"69","author":"X Song","year":"2018","unstructured":"Song, X., Chen, B., Yu, B.: An efficient duality-based approach for PDE-constrained sparse optimization. Computational Optimization and Applications 69, 461\u2013500 (2018). https:\/\/doi.org\/10.1007\/s10589-017-9951-4","journal-title":"Computational Optimization and Applications"},{"key":"2933_CR72","doi-asserted-by":"crossref","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines. ACM Transactions on Intelligent Systems and Technology 2, 27:1\u201327:27 (2011). Software available at http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm","DOI":"10.1145\/1961189.1961199"},{"key":"2933_CR73","doi-asserted-by":"publisher","unstructured":"Vapnik, V.N.: The Nature of Statistical Learning Theory. Information Science and Statistics. Springer, New York, NY (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3264-1","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"2933_CR74","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.N.: Support-vector networks. Machine Learning 20, 273\u2013297 (1995). https:\/\/doi.org\/10.1007\/BF00994018","journal-title":"Machine Learning"},{"key":"2933_CR75","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Proceedings of the Fifteenth International Conference on Machine Learning, ICML \u201998, pp. 82\u201490. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1998)"},{"key":"2933_CR76","unstructured":"Wang, L., Zhu, J., Zou, H.: The doubly regularized support vector machine. Statistica Sinica 16(2), 589\u2013615 (2006). http:\/\/www.jstor.org\/stable\/24307560"},{"key":"2933_CR77","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace Hilbertien. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France 93, 273\u2013299 (1965). https:\/\/doi.org\/10.24033\/bsmf.1625","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02933-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02933-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02933-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T17:04:02Z","timestamp":1757178242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02933-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,3]]},"references-count":77,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2933"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02933-x","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,6,3]]},"assertion":[{"value":"7 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"36"}}