{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:10:05Z","timestamp":1751368205122,"version":"3.41.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"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,12]]},"DOI":"10.1023\/a:1026596100403","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T17:11:16Z","timestamp":1068138676000},"page":"337-356","source":"Crossref","is-referenced-by-count":10,"title":["Dual Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints"],"prefix":"10.1007","volume":"18","author":[{"given":"Ivo","family":"Nowak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"281695_CR1","doi-asserted-by":"crossref","unstructured":"Adjiman, C.S., Androulakis, I.P. and C.A. Floudas, (1998), 'A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs\u2014I. Theoretical advances'. Computers and Chemical Engineering, 1137-1158.","DOI":"10.1016\/S0098-1354(98)00027-1"},{"key":"281695_CR2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01099462","volume":"6","author":"F.A. Al-Khayyal","year":"1995","unstructured":"Al-Khayyal, F.A., Larsen, C. and van Voorhis, T. (1995), A Relaxation Method for Nonconvex Quadratically Constrained Quadratic Programs. J. Global Opt. 6: 215-230.","journal-title":"J. Global Opt."},{"key":"281695_CR3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"L.T.H. An","year":"1996","unstructured":"An, L.T.H. and Tao, P.D. (1996), 'Solving a Class of Linearly Constrained Indefinite Quadratic Problems by D.C. Algorithms. J. of Global Opt., 11: 253-285.","journal-title":"J. of Global Opt."},{"key":"281695_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1008240227198","volume":"13","author":"L.T.H. An","year":"1998","unstructured":"An, L.T.H. and Tao, P.D. (1998), 'A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems'. J. of Global Opt., 13: 171-206.","journal-title":"J. of Global Opt."},{"key":"281695_CR5","unstructured":"Anstreicher, K. and Wolkowicz, H. (1998), 'On Lagrangian Relaxation of Quadratic Matrix Constraints'. Research Report CORR 98-24, Department of Combinatorics and Optimization, University of Waterloo."},{"key":"281695_CR6","unstructured":"Audet, C., Hansen, P., Jaumard, B. and Savard, G. (1997), 'A Branch and Cut Algorithm for Nonconvex Quadratically Constrained Quadratic Programming'. Technical report, Les Cashiers du GERAD G-97-67, Montr\u00e9al, 1997."},{"key":"281695_CR7","doi-asserted-by":"crossref","unstructured":"Feltenmark, S. and Kiwiel, K.C. (1999), 'Dual Applications of Proximal Bundle Methods, including Lagrangian relaxation of nonconvex problems'. to appear in SIAM Journal on Optimization.","DOI":"10.1137\/S1052623498332336"},{"key":"281695_CR8","doi-asserted-by":"crossref","unstructured":"Floudas, C.A. and Visweswaran, V. (1995), 'Quadratic Optimization'. In R. Horst and P. Pardalos, (eds.), Handbook of Global Optimization, pp. 217-269. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-2025-2_5"},{"key":"281695_CR9","unstructured":"Helmberg, C. (1999), http:\/\/www.zib.de\/helmberg\/semidef.html."},{"key":"281695_CR10","unstructured":"Helmberg, C. and Kiwiel, K.C. (1999), 'A Spectral Bundle Method with Bounds'. Preprint SC 99-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin, 1999."},{"key":"281695_CR11","unstructured":"Helmberg, C. and Rendl, F. (1997), 'A Spectral BundleMethod for Semidefinite Programming'. Preprint SC 97-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin."},{"key":"281695_CR12","doi-asserted-by":"crossref","unstructured":"Horst, R., Pardalos, P. and Thoai, N. (1995), Introduction to Global Optimization. Kluwer Academic Publishers, 1995.","DOI":"10.1007\/978-1-4615-2025-2"},{"key":"281695_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00429750","volume":"5","author":"R. Horst","year":"1996","unstructured":"Horst, R. and Thoai, N.V. (1996), 'A New Algorithm for Solving the General Quadratic Programming Problem. Comp. Opt. Appl., 5: 39-48.","journal-title":"Comp. Opt. Appl."},{"key":"281695_CR14","unstructured":"Lemar\u00e9chal, C. and Renaud, A. (1996), Dual-equivalent convex and non-convex problems. Technical report, INRIA, Rocquencourt, 1996."},{"key":"281695_CR15","unstructured":"Lemar\u00e9chal, C. and Renaud, A. (1999), 'A geometric study of duality gaps, with applications'. to appear in Mathematical Programming."},{"key":"281695_CR16","series-title":"Technical report","volume-title":"A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex","author":"I. Nowak","year":"1998","unstructured":"Nowak, I. (1998a), 'A Global Optimality Criterion for Nonconvex Quadratic Programming over a Simplex. Technical report, Preprint 98-18, Humboldt University Berlin."},{"key":"281695_CR17","series-title":"Technical report","volume-title":"Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex","author":"I. Nowak","year":"1998","unstructured":"Nowak, I. (1998b) 'Some Heuristics and Test Problems for Nonconvex Quadratic Programming over a Simplex'. Technical report, Preprint 98-17, Humboldt University Berlin."},{"key":"281695_CR18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1008315627883","volume":"14","author":"I. Nowak","year":"1999","unstructured":"Nowak, I. (1999), 'A new semidefinite programming bound for indefinite quadratic forms over a simplex'. J. Global Opt., 14: 357-364.","journal-title":"J. Global Opt."},{"key":"281695_CR19","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02239972","volume":"39","author":"P. Pardalos","year":"1987","unstructured":"Pardalos, P., Glick, J.H. and Rosen, J.B. (1987), 'Global Minimization of Indefinite Quadratic Problems'. Computing, 39: 281-291.","journal-title":"Computing"},{"key":"281695_CR20","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1002\/1520-6750(199008)37:4<499::AID-NAV3220370405>3.0.CO;2-9","volume":"37","author":"A.T. Phillips","year":"1990","unstructured":"Phillips, A.T. and Rosen, J.B. (1990), 'Guaranteed \n$$\\varepsilon $$\n-approximate Solution for Indefinite Quadratic Global Minimization. Naval Research Logistics, 37: 499-514.","journal-title":"Naval Research Logistics"},{"key":"281695_CR21","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1023\/A:1008377529330","volume":"13","author":"U. Raber","year":"1998","unstructured":"Raber, U. (1998), 'A Simplicial Branch and Bound Method for Solving Nonconvex All-Quadratic Programs'. J. Global Opt., 13: 417-432.","journal-title":"J. Global Opt."},{"key":"281695_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H.D. Sherali","year":"1995","unstructured":"Sherali, H.D. and Tuncbilek, C.H., (1995), 'A Reformulation-Convexification Approach for Solving Nonconvex Quadratic Programming Problems'. J. of Global Optimization, 7: 1-31.","journal-title":"J. of Global Optimization"},{"key":"281695_CR23","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF00122430","volume":"2","author":"N.Z. Shor","year":"1992","unstructured":"Shor, N.Z. (1992), 'Dual Estimates in Multiextremal Problems'. J. of Global Opt., 2: 411-418.","journal-title":"J. of Global Opt."},{"key":"281695_CR24","doi-asserted-by":"crossref","unstructured":"Shor, N.Z. (1998), Nondifferentiable Optimization and Polynomial Problems. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-6015-6"},{"key":"281695_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-7214-0","volume-title":"Numerische Verfahren der nichtlinearen Optimierung","author":"P. Spellucci","year":"1993","unstructured":"Spellucci, P. (1993), Numerische Verfahren der nichtlinearen Optimierung. Birkh\u00e4user Verlag, ISNM, Darmstadt."},{"key":"281695_CR26","unstructured":"Thoai, N. (1997), 'A decomposition method using duality bounds for nonconvex optimization'. Technical report, Research Report 97-24, University of Trier, 1997."},{"key":"281695_CR27","doi-asserted-by":"crossref","unstructured":"Thoai, N. (2000), Duality bound method for the general quadratic programming problem with quadratic constraints. Journal of Optimization Theory and Applications, 107(2), 2000.","DOI":"10.1023\/A:1026437621223"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026596100403.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026596100403\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026596100403.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:48:09Z","timestamp":1751366889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026596100403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["281695"],"URL":"https:\/\/doi.org\/10.1023\/a:1026596100403","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}