{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T07:09:18Z","timestamp":1750748958551,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T00:00:00Z","timestamp":1599868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T00:00:00Z","timestamp":1599868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s40314-020-01317-1","type":"journal-article","created":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T20:03:54Z","timestamp":1599941034000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A successive linear approximation algorithm for the global minimization of a concave quadratic program"],"prefix":"10.1007","volume":"39","author":[{"given":"Mohamed","family":"Telli","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3028-5118","authenticated-orcid":false,"given":"Mohand","family":"Bentobache","sequence":"additional","affiliation":[]},{"given":"Abdelkader","family":"Mokhtari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,12]]},"reference":[{"issue":"2","key":"1317_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008240227198","volume":"13","author":"LTH An","year":"1998","unstructured":"An LTH, Tao PD (1998) A branch and bound method via dc optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J Glob Optim 13(2):171\u2013206","journal-title":"J Glob Optim"},{"issue":"6","key":"1317_CR2","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1057\/palgrave.jors.2601545","volume":"54","author":"B Baesens","year":"2003","unstructured":"Baesens B, Van Gestel T, Viaene S, Stepanova M, Suykens J, Vanthienen J (2003) Benchmarking state-of-the-art classification algorithms for credit scoring. J Oper Res Soc 54(6):627\u2013635","journal-title":"J Oper Res Soc"},{"issue":"13","key":"1317_CR3","doi-asserted-by":"publisher","first-page":"621","DOI":"10.12988\/imf.2014.4234","volume":"9","author":"T Bayartugs","year":"2014","unstructured":"Bayartugs T, Battuvshin Ch, Enkhbat R (2014) Quadratic optimization over a polyhedral set. Int Math Forum 9(13):621\u2013629","journal-title":"Int Math Forum"},{"key":"1317_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1155\/2012\/482193","volume":"2012","author":"M Bentobache","year":"2012","unstructured":"Bentobache M, Bibi MO (2012) A two-phase support method for solving linear programs: numerical experiments. Math Probl Eng 2012:28. https:\/\/doi.org\/10.1155\/2012\/482193 (Article ID 482193)","journal-title":"Math Probl Eng"},{"key":"1317_CR5","volume-title":"Numerical methods of linear and quadratic programming","author":"M Bentobache","year":"2016","unstructured":"Bentobache M, Bibi MO (2016) Numerical methods of linear and quadratic programming. French Academic Presses, Germany (in French)"},{"key":"1317_CR6","unstructured":"Bentobache M, Telli M, Mokhtari A (2018a) A global minimization algorithm for concave quadratic programming. In: Proceedings of the 29th European conference on operational research, EURO 2018, University of Valencia, July 08\u201311, pp 329"},{"key":"1317_CR7","unstructured":"Bentobache M, Telli M, Mokhtari A (2018b) A simplex algorithm with the smallest index rule for concave quadratic programming. In: Proceedings of the eighth international conference on advanced communications and computation, INFOCOMP 2018, Barcelona, Spain, July 22\u201326, pp 88\u201393"},{"key":"1317_CR8","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific, Belmont","edition":"2"},{"issue":"1","key":"1317_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/00207160.2014.890188","volume":"92","author":"MO Bibi","year":"2015","unstructured":"Bibi MO, Bentobache M (2015) A hybrid direction algorithm for solving linear programs. Int J Comput Math 92(1):201\u2013216","journal-title":"Int J Comput Math"},{"key":"1317_CR10","doi-asserted-by":"publisher","first-page":"2553","DOI":"10.1088\/0305-4470\/13\/8\/005","volume":"13","author":"I Bieche","year":"1980","unstructured":"Bieche I, Maynard R, Rammal R, Uhry JP (1980) On the ground states of the frustration model of a spin glass by a matching method of graph theory. J Phys A Math Gen 13:2553\u20132576","journal-title":"J Phys A Math Gen"},{"issue":"4\u20135","key":"1317_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1002\/mcda.327","volume":"11","author":"V Bugera","year":"2002","unstructured":"Bugera V, Konno H, Uryasev S (2002) Credit cards scoring with quadratic utility functions. J Multi-Criteria Decis Anal 11(4\u20135):197\u2013211","journal-title":"J Multi-Criteria Decis Anal"},{"issue":"1","key":"1317_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen J, Burer S (2012) Globally solving nonconvex quadratic programming problems via completely positive programming. Math Program Comput 4(1):33\u201352","journal-title":"Math Program Comput"},{"issue":"6","key":"1317_CR13","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1080\/02331930500342534","volume":"54","author":"A Chinchuluun","year":"2005","unstructured":"Chinchuluun A, Pardalos PM, Enkhbat R (2005) Global minimization algorithms for concave quadratic programming problems. Optimization 54(6):627\u2013639","journal-title":"Optimization"},{"key":"1317_CR14","unstructured":"CPLEX Optimizer 12.8, IBM ILOG, I (2017)"},{"key":"1317_CR15","doi-asserted-by":"publisher","DOI":"10.7249\/R366","volume-title":"Linear programming and extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton"},{"key":"1317_CR16","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1006\/jmaa.1997.5745","volume":"217","author":"M D\u00fcr","year":"1998","unstructured":"D\u00fcr M, Horst R, Locatelli M (1998) Necessary and sufficient global optimality conditions for convex maximization revisited. J Math Anal Appl 217:637\u2013649","journal-title":"J Math Anal Appl"},{"key":"1317_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1142\/9789812775368_0006","volume":"1","author":"R Enkhbat","year":"2003","unstructured":"Enkhbat R (2003) On some theory, methods and algorithms for concave programming. In: Series on computers and operations research. Optim Optimal Control 1:79\u2013102","journal-title":"Optim Optimal Control"},{"key":"1317_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-0-387-89496-6_6","volume-title":"Optimization and optimal control, Springer optimization and its applications","author":"R Enkhbat","year":"2010","unstructured":"Enkhbat R, Bazarsad Y (2010) General quadratic programming and its applications in response surface analysis. In: Chinchuluun A et al (eds) Optimization and optimal control, Springer optimization and its applications, vol 39. Springer, Berlin, pp 121\u2013137"},{"key":"1317_CR19","volume-title":"Handbook of Test Problems in Local and Global Optimization (nonconvex optimization and its applications)","author":"CA Floudas","year":"1999","unstructured":"Floudas CA, Pardalos PM, Adjiman C, Esposito WR, G\u00fcm\u00fcs ZH, Harding ST, Klepeis JL, Meyer CA, Schweiger CA (1999) Handbook of Test Problems in Local and Global Optimization (nonconvex optimization and its applications). Springer, New York"},{"key":"1317_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logist Q 3:95\u2013110","journal-title":"Naval Res Logist Q"},{"key":"1317_CR21","doi-asserted-by":"crossref","unstructured":"Fung G (2003) The disputed Federalist Papers: SVM feature selection via concave minimization. In: Proceedings of the 2003 conference on diversity in computing, ACM. Atlanta, Georgia, USA, October 15\u201318, pp 42\u201346","DOI":"10.1145\/948542.948551"},{"key":"1317_CR22","unstructured":"Globallib: Gamsworld global optimization library. http:\/\/www.gamsworld.org\/global\/globallib.htm. Accessed 05 Jan 2019"},{"key":"1317_CR23","unstructured":"Guillou A (2013) Nonconvex quadratic problems under nonconvex quadratic constraints: numerical methods of global optimization, extensions and applications. Ph. D. Dissertation, Montreal University (in French)"},{"key":"1317_CR24","first-page":"55","volume":"3","author":"JB Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty JB, Ledyaev YS (1996) A note on the characterization of the global maxima of a (tangentially) convex function over a convex set. J Convex Anal 3:55\u201362","journal-title":"J Convex Anal"},{"key":"1317_CR25","unstructured":"Hoffman KL (1975) A successive underestimating method for concave minimization problems. Ph.D. Dissertation, The George Washington University"},{"key":"1317_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74503-9","volume-title":"Linear and nonlinear programming. International series in operations research and management science","author":"DG Luenberger","year":"2008","unstructured":"Luenberger DG, Ye Y (2008) Linear and nonlinear programming. International series in operations research and management science. Springer, Berlin"},{"key":"1317_CR27","unstructured":"MATLAB2018a (2018) The MathWorks, Inc., Natick, Massachusetts, United States"},{"issue":"4","key":"1317_CR28","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/opre.43.4.570","volume":"43","author":"OL Mangasarian","year":"1995","unstructured":"Mangasarian OL, Street WN, Wolberg WH (1995) Breast cancer diagnosis and prognosis via linear programming. Oper Res 43(4):570\u2013577","journal-title":"Oper Res"},{"issue":"2","key":"1317_CR29","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1109\/59.387950","volume":"10","author":"JA Momoh","year":"1995","unstructured":"Momoh JA, Dias LG, Guo SX, Adapa R (1995) Economic operation and planning of multi-area interconnected power systems. IEEE Trans Power Syst 10(2):1044\u20131053","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"1317_CR30","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Rodgers G (1990) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2):131\u2013144","journal-title":"Computing"},{"issue":"7","key":"1317_CR31","first-page":"908","volume":"43","author":"AI Rusakov","year":"2003","unstructured":"Rusakov AI (2003) Concave programming under simplest linear constraints. Comput Math Math Phys 43(7):908\u2013917","journal-title":"Comput Math Math Phys"},{"key":"1317_CR32","unstructured":"Rusakov AI (2003) Concave software manual. http:\/\/www.rusakov.donpac.ru\/index1.htm. Accessed 05 Feb 2018"},{"issue":"4","key":"1317_CR33","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1008277314050","volume":"12","author":"AS Strekalovsky","year":"1998","unstructured":"Strekalovsky AS (1998) Global optimality conditions for nonconvex optimization. J Glob Optim 12(4):415\u2013434","journal-title":"J Glob Optim"},{"issue":"1","key":"1317_CR34","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01585116","volume":"24","author":"YY Sung","year":"1982","unstructured":"Sung YY, Rosen JB (1982) Global minimum test problem construction. Math Program 24(1):353\u2013355","journal-title":"Math Program"},{"key":"1317_CR35","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/moor.5.4.556","volume":"5","author":"NV Thoai","year":"1980","unstructured":"Thoai NV, Tuy H (1980) Convergent algorithms for minimizing a concave function. Math Oper Res 5:556\u2013566","journal-title":"Math Oper Res"},{"issue":"4","key":"1317_CR36","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01096688","volume":"5","author":"NV Thoai","year":"1994","unstructured":"Thoai NV (1994) On the construction of test problems for concave minimization algorithms. J Glob Optim 5(4):399\u2013402","journal-title":"J Glob Optim"},{"issue":"1","key":"1317_CR37","first-page":"32","volume":"159","author":"H Tuy","year":"1964","unstructured":"Tuy H (1964) Concave programming with linear constraints. Dokl Akad Nauk SSSR 159(1):32\u201335","journal-title":"Dokl Akad Nauk SSSR"},{"key":"1317_CR38","volume-title":"Convex analysis and global optimization, Springer optimization and its applications book series","author":"H Tuy","year":"2016","unstructured":"Tuy H (2016) Convex analysis and global optimization, Springer optimization and its applications book series, vol 110. Springer, Berlin"},{"key":"1317_CR39","unstructured":"Xia W, Vera JC, Zuluaga LF (2018) Globally solving non-convex quadratic programs via linear integer programming techniques. arXiv:1511.02423v3 (arXiv preprint)"},{"issue":"6","key":"1317_CR40","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1287\/opre.21.6.1260","volume":"21","author":"PB Zwart","year":"1973","unstructured":"Zwart PB (1973) Nonlinear programming: counterexamples to two global optimization algorithms. Oper Res 21(6):1260\u20131266","journal-title":"Oper Res"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01317-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01317-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01317-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T23:23:48Z","timestamp":1631402628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01317-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,12]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1317"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01317-1","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2020,9,12]]},"assertion":[{"value":"11 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"272"}}