{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:23:30Z","timestamp":1743009810172,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_3","type":"book-chapter","created":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T02:03:24Z","timestamp":1560564204000},"page":"26-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Sequential Linear Programming Algorithm for Continuous and\u00a0Mixed-Integer Nonconvex Quadratic Programming"],"prefix":"10.1007","author":[{"given":"Mohand","family":"Bentobache","sequence":"first","affiliation":[]},{"given":"Mohamed","family":"Telli","sequence":"additional","affiliation":[]},{"given":"Abdelkader","family":"Mokhtari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"An, L.T.H., Tao, P.D.: A branch and bound method via dc optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Global Optim. 13(2), 171\u2013206 (1998)","DOI":"10.1023\/A:1008240227198"},{"issue":"1","key":"3_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10589-006-8717-1","volume":"36","author":"P-A Absil","year":"2007","unstructured":"Absil, P.-A., Tits, A.L.: Newton-KKT interior-point methods for indefinite quadratic programming. Comput. Optim. Appl. 36(1), 5\u201341 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"3_CR3","unstructured":"Bentobache, M., Telli, M., Mokhtari, A.: A global minimization algorithm for concave quadratic programming. In: Proceedings of the 29th European Conference on Operational Research, EURO 2018, p. 329, University of Valencia, 08\u201311 July 2018"},{"key":"3_CR4","unstructured":"Bentobache, M., Telli, M., Mokhtari, A.: 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, pp. 88\u201393, Barcelona, Spain, 22\u201326 July 2018"},{"issue":"6","key":"3_CR5","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1080\/02331930500342534","volume":"54","author":"A Chinchuluun","year":"2005","unstructured":"Chinchuluun, A., Pardalos, P.M., Enkhbat, R.: Global minimization algorithms for concave quadratic programming problems. Optimization 54(6), 627\u2013639 (2005)","journal-title":"Optimization"},{"key":"3_CR6","unstructured":"CPLEX12.8, IBM Ilog. Inc., NY (2017)"},{"key":"3_CR7","series-title":"Nonconvex Optimization and its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"CA Floudas","year":"1999","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization. Nonconvex Optimization and its Applications. Springer, Boston (1999)"},{"key":"3_CR8","unstructured":"Globallib: Gamsworld global optimization library. http:\/\/www.gamsworld.org\/global\/globallib.htm . Accessed 15 Jan 2019"},{"key":"3_CR9","first-page":"55","volume":"3","author":"JB Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty, J.B., Ledyaev, Y.S.: A note on the characterization of the global maxima of a (tangentially) convex function over a convex set. J. Convex Anal. 3, 55\u201362 (1996)","journal-title":"J. Convex Anal."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01580678","volume":"10","author":"R Horst","year":"1976","unstructured":"Horst, R.: An algorithm for nonconvex programming problems. Math. Program. 10, 312\u2013321 (1976)","journal-title":"Math. Program."},{"key":"3_CR11","unstructured":"Matlab2018a. Mathworks, Inc., NY (2018)"},{"issue":"2","key":"3_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Rodgers, G.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2), 131\u2013144 (1990)","journal-title":"Computing"},{"issue":"7","key":"3_CR13","first-page":"908","volume":"43","author":"AI Rusakov","year":"2003","unstructured":"Rusakov, A.I.: Concave programming under simplest linear constraints. Comput. Math. Math. Phys. 43(7), 908\u2013917 (2003)","journal-title":"Comput. Math. Math. Phys."},{"issue":"4","key":"3_CR14","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1023\/A:1008277314050","volume":"12","author":"AS Strekalovsky","year":"1998","unstructured":"Strekalovsky, A.S.: Global optimality conditions for nonconvex optimization. J. Global Optim. 12(4), 415\u2013434 (1998)","journal-title":"J. Global Optim."},{"issue":"1","key":"3_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01585116","volume":"24","author":"YY Sung","year":"1982","unstructured":"Sung, Y.Y., Rosen, J.B.: Global minimum test problem construction. Math. Program. 24(1), 353\u2013355 (1982)","journal-title":"Math. Program."},{"key":"3_CR16","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., An, L.T.H.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Telli, M., Bentobache, M.: Mokhtari, A: A Successive Linear Approximations Approach for the Global Minimization of a Concave Quadratic Program, Submitted to Computational and Applied Mathematics. Springer (2019)","DOI":"10.1007\/s40314-020-01317-1"},{"key":"3_CR18","first-page":"32","volume":"159","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave programming under linear constraints. Doklady Akademii Nauk SSSR 159, 32\u201335 (1964)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Tuy, H.: DC optimization problems. In : Convex analysis and global optimization. Springer optimization and its applications, vol. 110, pp. 167\u2013228, Second edn. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-31484-6_7"},{"issue":"1","key":"3_CR20","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1080\/00207160.2017.1418505","volume":"96","author":"F Wang","year":"2019","unstructured":"Wang, F.: A new exact algorithm for concave knapsack problems with integer variables. Int. J. Comput. Math. 96(1), 126\u2013134 (2019)","journal-title":"Int. J. Comput. Math."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Xia, W., Vera, J., Zuluaga, L. F.: Globally solving non-convex quadratic programs via linear integer programming techniques. arXiv preprint, arXiv:1511.02423v3 (2018)","DOI":"10.1287\/ijoc.2018.0883"}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T04:36:31Z","timestamp":1609907791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_3","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}