{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:08:07Z","timestamp":1753736887815,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T00:00:00Z","timestamp":1508976000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10107-017-1201-0","type":"journal-article","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T22:20:02Z","timestamp":1508970002000},"page":"489-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On max-k-sums"],"prefix":"10.1007","volume":"171","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9458-3443","authenticated-orcid":false,"given":"Michael J.","family":"Todd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"key":"1201_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/07468342.2008.11922293","volume":"39","author":"AT Benjamin","year":"2008","unstructured":"Benjamin, A.T., Quinn, J.J.: An alternate approach to alternating sums: a method to DIE for. The College Mathematics Journal 39, 191\u2013201 (2008)","journal-title":"Coll. Math. J."},{"key":"1201_CR2","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Athena Press, Belmont, MA (1996)"},{"unstructured":"Bogdan, J., van den Berg, E., Su, W., Candes E.: Statistical estimation and testing via the sorted \n                        $$\\ell _1$$\n                        \n                            \n                                \n                                    \u2113\n                                    1\n                                \n                            \n                        \n                     norm, manuscript, \n                        arXiv:1310.1969v2\n                        \n                     (2013)","key":"1201_CR3"},{"key":"1201_CR4","volume-title":"Analysis on Symmetric Cones","author":"J Faraut","year":"1995","unstructured":"J. Faraut and A. Koranyi, Analysis on Symmetric Cones, Oxford University Press, Oxford, 1995"},{"key":"1201_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0377-0427(97)00153-2","volume":"86","author":"L Faybusovich","year":"1997","unstructured":"Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. Journal of Computational and Applied Mathematics 86, 149\u2013175 (1997)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1201_CR6","first-page":"1","volume":"6","author":"L Faybusovich","year":"2016","unstructured":"Faybusovich, L.: E. Lieb convexity inequalities and noncommutative Bernstein inequality in Jordan-algebraic setting. Theoretical Mathematics Applications 6(2), 1\u201335 (2016)","journal-title":"Theor. Math. Appl."},{"key":"1201_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s002110050109","volume":"70","author":"J-B Hiriart-Urruty","year":"1995","unstructured":"J.-B. Hiriart-Urruty and D. Ye, Sensitivity analysis of all eigenvalues of a symmetric matrix, Numerische Mathematik 70 (1995), pp. 45\u201372","journal-title":"Numer. Math."},{"key":"1201_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01455996","volume":"269","author":"A Koranyi","year":"1984","unstructured":"A. Koranyi, Monotone functions on formally real Jordan algebras, Mathematische Annalen, 269 (1984), pp. 73\u201376","journal-title":"Math. Ann."},{"key":"1201_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01170633","volume":"38","author":"K L\u00d6wner","year":"1934","unstructured":"L\u00f6wner, K.: \u00dcber monotone matrixfunktionen. Mathematische Zeitschrift 38, 177\u2013216 (1934)","journal-title":"Math. Z."},{"key":"1201_CR10","volume-title":"Handbook of Mathematical Psychology","author":"RD Luce","year":"1965","unstructured":"Luce, R.D., Suppes, P.: Preference, utility, and subjective probability. In: Luce, R.D., Bush, R.R., Galanter, F. (eds.) Handbook of Mathematical Psychology, vol. III. Wiley, New York (1965)"},{"key":"1201_CR11","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1137\/0312052","volume":"12","author":"FH Murphy","year":"1974","unstructured":"Murphy, F.H.: A class of exponential penalty functions. SIAM Journal on Control 12, 679\u2013687 (1974)","journal-title":"SIAM J. Control"},{"key":"1201_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization, Springer, New York (2004)"},{"key":"1201_CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"YuE Nesterov","year":"2005","unstructured":"Yu. E. Nesterov, Smooth minimization of nonsmooth functions, Mathematical Programming, 103 (2005), pp. 127\u2013152","journal-title":"Math. Program."},{"key":"1201_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming","author":"YuE Nesterov","year":"1994","unstructured":"Yu. E. Nesterov and A. S. Nemirovskii, Interior Point Polynomial Methods in Convex Programming, SIAM Publications, Philadelphia, 1994"},{"unstructured":"Nemirovskii, A.S.: Private communication","key":"1201_CR15"},{"key":"1201_CR16","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, 1970"},{"key":"1201_CR17","doi-asserted-by":"crossref","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. The Journal of Risk 2, 21\u201341 (2000)","journal-title":"J. Risk"},{"key":"1201_CR18","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F Shahrokhi","year":"1990","unstructured":"F. Shahrokhi and D. W. Matula, The maximum concurrent flow problem, Journal of the ACM, 37 (1990), pp. 318\u2013334","journal-title":"J. ACM"},{"key":"1201_CR19","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10208-010-9069-x","volume":"10","author":"L Tun\u00e7el","year":"2010","unstructured":"Tun\u00e7el, L., Nemirovskii, A.S.: Self-concordant barriers for convex approximations of structured convex sets. Foundations of Computational Mathematics 10, 485\u2013525 (2010)","journal-title":"Found. Comput. Math."},{"key":"1201_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.orl.2013.12.001","volume":"47","author":"G Zakeri","year":"2014","unstructured":"Zakeri, G., Craigie, D., Philpott, A., Todd, M.J.: Optimization of demand response through peak shaving. Operations Research Letters 47, 97\u2013101 (2014)","journal-title":"Op. Res. Lett."},{"key":"1201_CR21","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/LSP.2014.2331977","volume":"21","author":"X Zeng","year":"2014","unstructured":"X. Zeng and M. Figueiredo, Decreasing weighted sorted \n                        $$\\ell _1$$\n                        \n                            \n                                \n                                    \u2113\n                                    1\n                                \n                            \n                        \n                     regularization, IEEE Signal Processing Letters, 21 (2014), pp. 1240\u20131244","journal-title":"IEEE Signal Process. Lett."},{"unstructured":"Zeng, X., Figueiredo, M.: The ordered weighted \n                        $$\\ell _1$$\n                        \n                            \n                                \n                                    \u2113\n                                    1\n                                \n                            \n                        \n                     norm: atomic formulation, projections, and algorithms, manuscript, \n                        arXiv:1409.4271v3\n                        \n                    , (2014)","key":"1201_CR22"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1201-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1201-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1201-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,16]],"date-time":"2018-08-16T03:18:48Z","timestamp":1534389528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1201-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,26]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1201"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1201-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2017,10,26]]}}}