{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:34Z","timestamp":1751429434725,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":[[2002,11]]},"DOI":"10.1023\/a:1020300717650","type":"journal-article","created":{"date-parts":[[2003,3,15]],"date-time":"2003-03-15T13:44:30Z","timestamp":1047735870000},"page":"333-348","source":"Crossref","is-referenced-by-count":6,"title":["Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems"],"prefix":"10.1007","volume":"24","author":[{"given":"Masakazu","family":"Kojima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Levent","family":"Tun\u00e7el","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"389203_CR1","volume-title":"Management Science Research Report","author":"E. Balas","year":"1974","unstructured":"Balas, E. (1974), Disjunctive programming: Properties of the convex hull of feasible points. Management Science Research Report 348 GSIA, Carnegie Mellon University, Pittsburgh, PA, USA."},{"key":"389203_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E.S. Balas","year":"1993","unstructured":"Balas, E., S. Ceria and G. Cornu\u00e9jols (1993), A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming 58: 295\u2013323.","journal-title":"Mathematical Programming"},{"key":"389203_CR3","doi-asserted-by":"crossref","unstructured":"Ceria, S. and G. Pataki (1998), Solving integer and disjunctive programs by lift-and-project. Proceedings of the Sixth IPCO Conference.","DOI":"10.1007\/3-540-69346-7_21"},{"key":"389203_CR4","unstructured":"Cottle, R. W., J.-S. Pang and R. E. Stone (1992), Linear Complementarity Problem, Academic Press."},{"key":"389203_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G. Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G. and Y. Li (2001), Elementary closures for integer programs. Operations Research Letters 28: 1\u20138.","journal-title":"Operations Research Letters"},{"key":"389203_CR6","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/S1052623498336450","volume":"10","author":"M. Kojima","year":"2000","unstructured":"Kojima, M. and L. Tun\u00e7el (2000), Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optimization 10: 750\u2013778.","journal-title":"SIAM J. Optimization"},{"key":"389203_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/PL00011394","volume":"89","author":"M. Kojima","year":"2000","unstructured":"Kojima, M. and L. Tun\u00e7el (2000), Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems. Mathematical Programming 89: 79\u2013111.","journal-title":"Mathematical Programming"},{"key":"389203_CR8","unstructured":"Kojima, M. and L. Tun\u00e7el (to appear), On the finite convergence of successive SDP relaxation methods. European J. Oper. Res."},{"key":"389203_CR9","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L. and A. Schrijver (1991), Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization 1: 166\u2013190.","journal-title":"SIAM J. Optimization"},{"key":"389203_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. L. Nemhauser","year":"1988","unstructured":"Nemhauser, G. L. and L. A. Wolsey (1988), Integer and Combinatorial Optimization, Wiley, New York."},{"key":"389203_CR11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0909022","volume":"9","author":"P. M. Pardalos","year":"1988","unstructured":"Pardalos, P. M. and J. B. Rosen (1988), Global optimization approach to the linear complementarity problem. SIAM J. Scientific and Statistical Computing 9: 341\u2013353.","journal-title":"SIAM J. Scientific and Statistical Computing"},{"key":"389203_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. D. Sherali","year":"1990","unstructured":"Sherali, H. D. and W. P. Adams (1990), A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Mathematics 3: 411\u2013430.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"389203_CR13","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1023\/A:1021734613201","volume":"99","author":"H. D. Sherali","year":"1998","unstructured":"Sherali, H. D., R. S. Krishnamurty and F. A. Al-Khayyal (1998), Enumeration approach for linear complementarity problems based on a reformulation-linearization technique. J. of Optim. Theory and Applications 99: 481\u2013507.","journal-title":"J. of Optim. Theory and Applications"},{"key":"389203_CR14","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1287\/moor.22.4.969","volume":"22","author":"M. Shida","year":"1997","unstructured":"Shida, M., S. Shindoh and M. Kojima (1997), Centers of monotone generalized complementarity problems. Mathematics of Operations Research 22: 969\u2013976.","journal-title":"Mathematics of Operations Research"},{"key":"389203_CR15","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R. A. Stubbs","year":"1999","unstructured":"Stubbs, R. A. and S. Mehrotra (1999), A branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming 86: 515\u2013532.","journal-title":"Mathematical Programming"},{"key":"389203_CR16","unstructured":"Takeda, A. and M. Kojima (to appear), Successive convex relaxation approach to bilevel quadratic optimization problems. In Applications and Algorithms of Complementarity M.C."},{"key":"389203_CR17","unstructured":"Ferris, O.L. Mangasarian and J.-S. Pang eds., Kluwer Academic Publishers, Dordrecht, The Netherlands."},{"key":"389203_CR18","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-1-4757-3145-3_28","volume-title":"Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems","author":"A. Takeda","year":"2000","unstructured":"Takeda, A., Dai, Y., Fukuda, M. and Kojima, M. (2000), Towards the implementations of successive convex relaxation methods for nonconvex quadratic optimization problem. In Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems P.M. Pardalos, Editor, Kluwer Academic Press, Dordrecht, The Netherlands: 489\u2013510."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020300717650.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020300717650\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020300717650.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:39:21Z","timestamp":1751366361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020300717650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["389203"],"URL":"https:\/\/doi.org\/10.1023\/a:1020300717650","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}