{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:46:11Z","timestamp":1774953971166,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T00:00:00Z","timestamp":1491264000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T00:00:00Z","timestamp":1491264000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["KAKENHI 26280004"],"award-info":[{"award-number":["KAKENHI 26280004"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["16K16011"],"award-info":[{"award-number":["16K16011"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["ERATO, Kawarabayashi Large Graph Project"],"award-info":[{"award-number":["ERATO, Kawarabayashi Large Graph Project"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004398","name":"Mitsubishi Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004398","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003382","name":"Core Research for Evolutional Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10107-017-1139-2","type":"journal-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T11:18:41Z","timestamp":1491391121000},"page":"199-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Continuous relaxation for discrete DC programming"],"prefix":"10.1007","volume":"169","author":[{"given":"Takanori","family":"Maehara","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Marumo","sequence":"additional","affiliation":[]},{"given":"Kazuo","family":"Murota","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,4]]},"reference":[{"key":"1139_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F Bach","year":"2012","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. 4, 1\u2013106 (2012)","journal-title":"Found. Trends Mach. Learn."},{"key":"1139_CR2","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1139_CR3","first-page":"3","volume":"53","author":"P Favati","year":"1990","unstructured":"Favati, P., Tardella, F.: Convexity in nonlinear integer programming. Ricerca Oper. 53, 3\u201344 (1990)","journal-title":"Ricerca Oper."},{"key":"1139_CR4","unstructured":"Fujishige, S.: Submodular Functions and Optimization. 2nd ed., Ann. Discret. Math., vol.\u00a058, Elsevier, Amsterdam (2005)"},{"key":"1139_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.disopt.2014.02.002","volume":"12","author":"S Fujishige","year":"2014","unstructured":"Fujishige, S.: Bisubmodular polyhedra, simplicial divisions, and discrete convexity. Discret. Optim. 12, 115\u2013120 (2014)","journal-title":"Discret. Optim."},{"key":"1139_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"1139_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1080\/02331930108844555","volume":"50","author":"LT Hoai An","year":"2001","unstructured":"Hoai An, L.T., Tao, P.D.: A continuous approach for globally solving linearly constrained quadratic zero-one programming problems. Optimization 50, 93\u2013120 (2001)","journal-title":"Optimization"},{"key":"1139_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Thoai, N.V.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996)"},{"key":"1139_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103, 1\u201343 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"1139_CR10","volume-title":"Resource Allocation Problems: Algorithmic Approaches","author":"T Ibaraki","year":"1988","unstructured":"Ibaraki, T., Katoh, N.: Resource Allocation Problems: Algorithmic Approaches. MIT Press, Cambridge (1988)"},{"key":"1139_CR11","unstructured":"Iyer, R., Jegelka, S., Bilmes J.: Fast semidifferential-based submodular function optimization. In: Proceedings of the 30th International Conference on Machine Learning, pp.\u00a0855\u2013863 (2013)"},{"key":"1139_CR12","doi-asserted-by":"publisher","first-page":"2897","DOI":"10.1007\/978-1-4419-7997-1_44","volume-title":"Handbook of Combinatorial Optimization","author":"N Katoh","year":"2013","unstructured":"Katoh, N., Shioura, A., Ibaraki, T.: Resource Allocation Problems. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, vol. 5, 2nd edn, pp. 2897\u20132988. Springer, Berlin (2013)","edition":"2"},{"key":"1139_CR13","unstructured":"Kawahara, Y., Washio, T.: Prismatic algorithm for discrete D.C. programming problem. In: Proceedings of the 25th Annual Conference on Neural Information Processing Systems, pp.\u00a02106\u20132114 (2011)"},{"key":"1139_CR14","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2015.08.011","volume":"43","author":"Y Kobayashi","year":"2015","unstructured":"Kobayashi, Y.: The complexity of minimizing the difference of two M$${}^\\natural $$-convex set functions. Op. Res. Lett. 43, 573\u2013574 (2015)","journal-title":"Op. Res. Lett."},{"key":"1139_CR15","first-page":"1890","volume":"24","author":"MO Larsson","year":"2011","unstructured":"Larsson, M.O., Ugander, J.: A concave regularization technique for sparse mixture models. Adv. Neural Inf. Process. Syst. 24, 1890\u20131898 (2011)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1139_CR16","unstructured":"Lemke, P.: The maximum leaf spanning tree problem for cubic graphs is NP-complete, IMA Preprint Series #428, University of Minnesota (1988)"},{"key":"1139_CR17","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-014-0792-y","volume":"152","author":"T Maehara","year":"2015","unstructured":"Maehara, T., Murota, K.: A framework of discrete DC programming by discrete convex analysis. Math. Program. Ser. A 152, 435\u2013466 (2015)","journal-title":"Math. Program. Ser. A"},{"key":"1139_CR18","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1137\/080736156","volume":"21","author":"S Moriguchi","year":"2011","unstructured":"Moriguchi, S., Shioura, A., Tsuchimura, N.: M-convex function minimization by continuous relaxation approach\u2013Proximity theorem and algorithm. SIAM J. Optim. 21, 633\u2013668 (2011)","journal-title":"SIAM J. Optim."},{"key":"1139_CR19","first-page":"227","volume":"5","author":"S Moriguchi","year":"2009","unstructured":"Moriguchi, S., Tsuchimura, N.: Discrete L-convex function minimization based on continuous relaxation. Pac. J. Optim. 5, 227\u2013236 (2009)","journal-title":"Pac. J. Optim."},{"key":"1139_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718508","volume-title":"Discrete Convex Analysis","author":"K Murota","year":"2003","unstructured":"Murota, K.: Discrete Convex Analysis. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"key":"1139_CR21","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-76796-1_11","volume-title":"Research Trends in Combinatorial Optimization, Chapter 11","author":"K Murota","year":"2009","unstructured":"Murota, K.: Recent developments in discrete convex analysis. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, Chapter 11, pp. 219\u2013260. Springer, Berlin (2009)"},{"key":"1139_CR22","unstructured":"Narasimhan, M., Bilmes, J.: A submodular-supermodular procedure with applications to discriminative structure learning. In: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, pp.\u00a0404\u2013412 (2005)"},{"key":"1139_CR23","first-page":"244","volume":"14","author":"YS Niu","year":"2008","unstructured":"Niu, Y.S., Tao, P.D.: A DC programming approach for mixed-integer linear programs. Model. Comput. Optim. Inf. Syst. Manage. Sci. Commun. Comput. Inf. Sci. 14, 244\u2013253 (2008)","journal-title":"Model. Comput. Optim. Inf. Syst. Manage. Sci. Commun. Comput. Inf. Sci."},{"key":"1139_CR24","first-page":"200","volume-title":"Mathematical Programming: State of the Art 1994","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M.: On the passage from local to global in optimization. In: Birge, J.R., Murty, K.G. (eds.) Mathematical Programming: State of the Art 1994, pp. 200\u2013247. The University of Michigan, Ann Arbor (1994)"},{"key":"1139_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/0-387-32942-0_2","volume-title":"Handbook on Modelling for Discrete Optimization","author":"PM Pardalos","year":"2006","unstructured":"Pardalos, P.M., Prokopyev, O., Busygin, S.: Continuous approaches for solving discrete optimization problems. In: Appa, G., Pitsoulis, L., Williams, H.P. (eds.) Handbook on Modelling for Discrete Optimization, pp. 39\u201360. Springer, Berlin (2006)"},{"key":"1139_CR26","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.dam.2005.02.028","volume":"151","author":"T Sch\u00fcle","year":"2005","unstructured":"Sch\u00fcle, T., Schn\u00f6rr, C., Weber, S., Hornegger, J.: Discrete tomography by convex-concave regularization and D.C. programming. Discret. Appl. Math. 151, 229\u2013243 (2005)","journal-title":"Discret. Appl. Math."},{"key":"1139_CR27","volume-title":"Computer Networks","author":"AS Tanenbaum","year":"2010","unstructured":"Tanenbaum, A.S.: Computer Networks, 5th edn. Prentice Hall, Upper Saddle River, New Jersey (2010)","edition":"5"},{"key":"1139_CR28","first-page":"277","volume-title":"Trends in Mathematical Optimization, International Series of Numerical Mathematics","author":"PD Tao","year":"1987","unstructured":"Tao, P.D., El Bernoussi, S.: Duality in D.C. (difference of convex functions) optimization: Subgradient methods. In: Hoffman, K.H., Zowe, J., Hiriart-Urruty, J.B., Lemar\u00e9chal, C. (eds.) Trends in Mathematical Optimization, International Series of Numerical Mathematics, vol. 84, pp. 277\u2013293. Birkh\u00e4user, Basel (1987)"},{"key":"1139_CR29","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., Hoai An, L.T.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"1139_CR30","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-1-4615-2025-2_4","volume-title":"Handbook of Global Optimization","author":"H Tuy","year":"1995","unstructured":"Tuy, H.: D.C. optimization: theory, methods and algorithms. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 149\u2013216. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"1139_CR31","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"AL Yuille","year":"2003","unstructured":"Yuille, A.L., Rangarajan, A.: The concave-convex procedure. Neural Comput. 15, 915\u2013936 (2003)","journal-title":"Neural Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1139-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1139-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1139-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:21:38Z","timestamp":1589646098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1139-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,4]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1139"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1139-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,4]]},"assertion":[{"value":"17 August 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}