{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:38Z","timestamp":1751429438503,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1023\/a:1008397325409","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T14:41:38Z","timestamp":1040568098000},"page":"165-188","source":"Crossref","is-referenced-by-count":9,"title":["A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints"],"prefix":"10.1007","volume":"18","author":[{"given":"Chuangyin","family":"Dang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"268154_CR1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"Barahona, F., Junger M., and Reinelt G., (1989). Experiments in quadratic 0-1 programming, Math. Program. 44: 127-137.","journal-title":"Math. Program."},{"key":"268154_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R. Carraghan","year":"1990","unstructured":"Carraghan R. and Pardalos, P.M. (1990). An exact algorithm for the maximum clique problem, Oper. Res. Lett. 9: 375-382.","journal-title":"Oper. Res. Lett."},{"key":"268154_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"M.W. Carter","year":"1984","unstructured":"Carter, M.W., (1984). The indefinite zero-one quadratic problem, Discrete Appl. Math. 7, 23-44.","journal-title":"Discrete Appl. Math."},{"key":"268154_CR4","doi-asserted-by":"crossref","unstructured":"De Angelis, P.L., Pardalos, P.M. and Toraldo G., (1997). Quadratic programming with box constraints, in I.M. Bomze, T. Csendes, R. Horst, P.M. Pardalos (eds.), Developments in Global Optimization, Kluwer Academic Publishers, 73-93.","DOI":"10.1007\/978-1-4757-2600-8_5"},{"key":"268154_CR5","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/326689a0","volume":"326","author":"R. Durbin","year":"1987","unstructured":"Durbin, R. and Willshaw, D. (1987). An analog approach to the traveling salesman problem using an elastic net method, Nature 326: 689-691.","journal-title":"Nature"},{"key":"268154_CR6","doi-asserted-by":"crossref","unstructured":"Fang, S.C., Rajasekera, J.R. and Tsao, H.S.J. (1997). Entropy Optimization and Mathematical Programming, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-6131-6"},{"key":"268154_CR7","doi-asserted-by":"crossref","unstructured":"Floudas, C.A. and Visweswaran, V. (1995). Quadratic optimization, in R. Horst and P.M. Pardalos (eds.), Handbook of Global Optimization, Kluwer Academic Publishers, 217-269.","DOI":"10.1007\/978-1-4615-2025-2_5"},{"key":"268154_CR8","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1080\/02331939108843700","volume":"22","author":"L. Grippo","year":"1991","unstructured":"Grippo, L. and Lucidi, S. (1991). A differentiable exact penalty function for bound constrained quadratic programming problems, Optimization 22: 557-578.","journal-title":"Optimization"},{"key":"268154_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(84)90055-9","volume":"15","author":"V.P. Gulati","year":"1984","unstructured":"Gulati, V.P., Gupta, S.K. and Mital, A.K., (1984). Unconstrained quadratic bivalent programming problems, European J. of Op. Res. 15: 121-125.","journal-title":"European J. of Op. Res."},{"key":"268154_CR10","first-page":"83","volume":"31","author":"P.L. Hammer","year":"1987","unstructured":"Hammer, P.L. and Simeone, B. (1987). Order relations of variables in 0-1 programming, Ann. Discrete Maths 31: 83-112.","journal-title":"Ann. Discrete Maths"},{"key":"268154_CR11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","volume":"5","author":"P. Hansen","year":"1979","unstructured":"Hansen, P. (1979). Methods of nonlinear zero-one programming, Annals of Discrete Maths 5: 53-70.","journal-title":"Annals of Discrete Maths"},{"key":"268154_CR12","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1073\/pnas.81.10.3088","volume":"81","author":"J.J. Hopfield","year":"1984","unstructured":"Hopfield, J.J. (1984). Neurons with graded response have collective computational properties like those of two-state neurons, Proc. Nat. Acad. Sci U.S.A. 81: 3088-3092.","journal-title":"Proc. Nat. Acad. Sci U.S.A."},{"key":"268154_CR13","unstructured":"Minoux, M. (1986). Mathematical Programming: Theory and Algorithms, John Wiley & Sons."},{"key":"268154_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K.G. Murty","year":"1987","unstructured":"Murty, K.G. and Kabadi, S.N., (1987). Some NP-complete problems in quadratic and nonlinear programming, Math. Prog. 39: 117-129.","journal-title":"Math. Prog."},{"key":"268154_CR15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/103147.103156","volume":"17","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos, P.M. (1991). Construction of test problems in quadratic bivalent programming, ACM Transact Math Software 17: 74-87.","journal-title":"ACM Transact Math Software"},{"key":"268154_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","volume":"11","author":"P.M. Pardalos","year":"1992","unstructured":"Pardalos, P.M. and Jha, S., (1992). Complexity of uniqueness and local search in quadratic 0-1 programming, Oper. Res. Lett. 11: 119-123.","journal-title":"Oper. Res. Lett."},{"key":"268154_CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos, P.M. and Rodgers, G.P., (1990). Computational aspects of a branch and bound algorithm for quadratic zero-one programming, Computing 45: 131-144.","journal-title":"Computing"},{"key":"268154_CR18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","volume":"19","author":"P.M. Pardalos","year":"1992","unstructured":"Pardalos, P.M. and Rodgers, G.P., (1992). A branch and bound algorithm for the maximum clique problem, Comput. Oper. Res. 19: 363-375.","journal-title":"Comput. Oper. Res."},{"key":"268154_CR19","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M. and Rosen, J.B., (1987). Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Sciences 268, Springer.","DOI":"10.1007\/BFb0000035"},{"key":"268154_CR20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1162\/neco.1990.2.3.261","volume":"2","author":"C. Peterson","year":"1990","unstructured":"Peterson, C. (1990). Parallel distributed approaches to combinatorial optimization problems\u2013benchmark studies on T.S.P., Neural Computation 2: 261-270.","journal-title":"Neural Computation"},{"key":"268154_CR21","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/moor.20.3.550","volume":"20","author":"S. Poljak","year":"1995","unstructured":"Poljak, S. and Wolkowicz, H., (1995). Convex relaxations of (0,1)-quadratic programming, Maths of Oper. Res. 20: 550-561.","journal-title":"Maths of Oper. Res."},{"key":"268154_CR22","doi-asserted-by":"crossref","unstructured":"Vavasis, S.A., (1991). On approximation algorithms for concave quadratic programming, in C.A. Floudas and P.M. Pardalos (eds.), Recent Advances in Global Optimization, Princeton University Press, 1992, 3-18.","DOI":"10.1515\/9781400862528.3"},{"key":"268154_CR23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01580903","volume":"56","author":"Y. Ye","year":"1992","unstructured":"Ye, Y., (1992). On affine scaling algorithms for nonconvex quadratic programming, Math Program. 56: 285-300.","journal-title":"Math Program."},{"key":"268154_CR24","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1162\/neco.1994.6.3.341","volume":"6","author":"A.L. Yuille","year":"1994","unstructured":"Yuille, A.L. and Kosowsky, J.J. (1994). Statistical physics algorithms that converges, Neural Computation 6: 341-356.","journal-title":"Neural Computation"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008397325409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008397325409\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008397325409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:41:22Z","timestamp":1751366482000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008397325409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["268154"],"URL":"https:\/\/doi.org\/10.1023\/a:1008397325409","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}