{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:21:09Z","timestamp":1648866069732},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,3,27]],"date-time":"2008-03-27T00:00:00Z","timestamp":1206576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s10898-008-9297-7","type":"journal-article","created":{"date-parts":[[2008,3,26]],"date-time":"2008-03-26T11:04:52Z","timestamp":1206529492000},"page":"369-384","source":"Crossref","is-referenced-by-count":7,"title":["Efficient interval partitioning for constrained global optimization"],"prefix":"10.1007","volume":"42","author":[{"given":"Chandra Sekhar","family":"Pedamallu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linet","family":"\u00d6zdamar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Csendes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Vink\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,27]]},"reference":[{"key":"9297_CR1","volume-title":"Introduction to Interval Computations","author":"G. Alefeld","year":"1983","unstructured":"Alefeld G. and Herzberger J. (1983). Introduction to Interval Computations. Academic Press, New York"},{"key":"9297_CR2","first-page":"213","volume":"13","author":"J. Balogh","year":"2005","unstructured":"Balogh J. and T\u00f3th B. (2005). Global optimization on Stiefel manifolds: a computational approach. CEJOR 13: 213\u2013232","journal-title":"CEJOR"},{"key":"9297_CR3","unstructured":"Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP(intervals) revisited. In: Proc. of ILPS\u201994, pp. 124\u2013138 (1994)"},{"key":"9297_CR4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s006070070010","volume":"65","author":"L.G. Casado","year":"2000","unstructured":"Casado L.G., Garc\u00eda I. and Csendes T. (2000). A new multisection technique in interval methods for global optimization. Computing 65: 263\u2013269","journal-title":"Computing"},{"key":"9297_CR5","unstructured":"COCONUT, http:\/\/www.mat.univie.ac.at\/~neum\/glopt\/coconut\/"},{"key":"9297_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01096739","volume":"3","author":"T. Csendes","year":"1993","unstructured":"Csendes T. and Rapcs\u00e1k T. (1993). Nonlinear coordinate transformations for unconstrained optimization. I. Basic transformations. J. Global Optim. 3: 213\u2013221","journal-title":"J. Global Optim."},{"key":"9297_CR7","first-page":"319","volume":"76","author":"T. Csendes","year":"1996","unstructured":"Csendes T. and Ratz D. (1996). A review of subdivision direction selection in interval methods for global optimization. ZAMM 76: 319\u2013322","journal-title":"ZAMM"},{"key":"9297_CR8","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1137\/S0036142995281528","volume":"34","author":"T. Csendes","year":"1997","unstructured":"Csendes T. and Ratz D. (1997). Subdivision direction selection in interval methods for global optimization. SIAM J. Numer. Anal. 34: 922\u2013938","journal-title":"SIAM J. Numer. Anal."},{"key":"9297_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-1-4757-2600-8_2","volume-title":"Developments in global optimization","author":"S. Dallwig","year":"1997","unstructured":"Dallwig S., Neumaier A. and Schichl H. (1997). GLOPT\u2014a program for constrained global optimization. In: Bomze, I.M., Csendes, T., Horst, R., and Pardalos, P.M. (eds) Developments in global optimization, pp 19\u201336. Kluwer, Dordrecht"},{"key":"9297_CR10","unstructured":"Drud, A.S.: CONOPT: A System for Large Scale Nonlinear Optimization. Reference Manual for CONOPT Subroutine Library, ARKI Consulting and Development A\/S, Bagsvaerd, Denmark (1996)"},{"key":"9297_CR11","unstructured":"Epperly, T.G.: Global optimization of nonconvex nonlinear programs using parallel branch and bound. PhD dissertation, University of Wisconsin-Madison, USA (1995)"},{"key":"9297_CR12","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. Numerical Analysis Report 97-2, Department of Mathematics, University of California, San Diego, La Jolla, CA (1997)"},{"key":"9297_CR13","volume-title":"Global Optimization Using Interval Analysis","author":"E.R. Hansen","year":"1992","unstructured":"Hansen E.R. (1992). Global Optimization Using Interval Analysis. Marcel Dekker, New York"},{"key":"9297_CR14","volume-title":"Interval Mathematics","author":"E. Hansen","year":"1980","unstructured":"Hansen E. and Sengupta S. (1980). Global constrained optimization using interval analysis. In: Nickel, K.L. (eds) Interval Mathematics. Academic Press, New York"},{"key":"9297_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02253433","volume":"47","author":"R.B. Kearfott","year":"1991","unstructured":"Kearfott R.B. (1991). Decompostion of arithmetic expressions to improve the behaviour of interval iteration for nonlinear systems. Computing 47: 169\u2013191","journal-title":"Computing"},{"key":"9297_CR16","volume-title":"An overview of the GlobSol Package for Verified Global Optimization. Talk given for the Department of Computing and Software","author":"R.B. Kearfott","year":"2003","unstructured":"Kearfott R.B. (2003). An overview of the GlobSol Package for Verified Global Optimization. Talk given for the Department of Computing and Software. McMaster University, Ontario, Canada"},{"key":"9297_CR17","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1145\/78928.78931","volume":"16","author":"R.B. Kearfott","year":"1990","unstructured":"Kearfott R.B. and Manuel N. III (1990). A portable interval Newton\/bisection package. ACM Trans. Math. Software 16: 152\u2013157","journal-title":"ACM Trans. Math. Software"},{"key":"9297_CR18","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF02307379","volume":"53","author":"O. Kn\u00fcppel","year":"1994","unstructured":"Kn\u00fcppel O. (1994). PROFIL\/BIAS\u2014a fast interval library. Computing 53: 277\u2013287","journal-title":"Computing"},{"key":"9297_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf R.E. (1985). Depth-first iterative deepening: An optimal admissible tree search. Artif. Intell. 27: 97\u2013109","journal-title":"Artif. Intell."},{"key":"9297_CR20","unstructured":"Mark\u00f3t, M.C.: Reliable global optimization methods for constrained problems and their application for solving circle packing problems. PhD dissertation, University of Szeged, Hungary (2003)"},{"key":"9297_CR21","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/s10107-005-0607-2","volume":"106","author":"M.C. Mark\u00f3t","year":"2006","unstructured":"Mark\u00f3t M.C., Fernandez J., Casado L.G. and Csendes T. (2006). New interval methods for constrained global optimization. Math. Program. 106: 278\u2013318","journal-title":"Math. Program."},{"key":"9297_CR22","unstructured":"Murtagh, B.A., Saunders, M.A.: MINOS 5.0 User\u2019s Guide. Report SOL 83-20, Department of Operations Research, Stanford University, USA (1987)"},{"key":"9297_CR23","doi-asserted-by":"crossref","unstructured":"Pedamallu, C.S., \u00d6zdamar, L., Csendes, T.: An interval partitioning approach for continuous constrained optimization. In: Models and Algorithms in Global Optimization, pp. 73\u201396. Springer, Berlin (2006)","DOI":"10.1007\/978-0-387-36721-7_5"},{"key":"9297_CR24","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10898-006-9043-y","volume":"37","author":"C.S. Pedamallu","year":"2007","unstructured":"Pedamallu C.S., \u00d6zdamar L. and Csendes T. (2007). Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms. J. Global Optim. 37: 177\u2013194","journal-title":"J. Global Optim."},{"key":"9297_CR25","doi-asserted-by":"crossref","unstructured":"Pedamallu, C.S., P\u00f3sfai, J., Csendes, T.: Interval partitioning algorithm for constraint satisfaction problems. Int. J. of Model. Identif. Control. (accepted for publication)","DOI":"10.1504\/IJMIC.2011.042347"},{"key":"9297_CR26","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-1-4757-2600-8_12","volume-title":"Developments in Global Optimization","author":"J.D. Pint\u00e9r","year":"1997","unstructured":"Pint\u00e9r J.D. (1997). LGO\u2014a program system for continuous and Lipschitz global optimization. In: Bomze, I.M., Csendes, T., Horst, R. and Pardalos, P.M. (eds) Developments in Global Optimization, pp 183\u2013197. Kluwer, Boston"},{"key":"9297_CR27","unstructured":"PrincetonLib.: Princeton Library of Nonlinear Programming Models. http:\/\/www.gamsworld.org\/performance\/princetonlib\/princetonlib.htm"},{"key":"9297_CR28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01096776","volume":"3","author":"T. Rapcs\u00e1k","year":"1993","unstructured":"Rapcs\u00e1k T. and Csendes T. (1993). Nonlinear coordinate transformations for unconstrained optimization. II. Theoretical background. J. Global Optim. 3: 359\u2013375","journal-title":"J. Global Optim."},{"key":"9297_CR29","volume-title":"New computer Methods for Global Optimization","author":"H. Ratschek","year":"1988","unstructured":"Ratschek H. and Rokne J. (1988). New computer Methods for Global Optimization. Ellis Horwood, Chichester"},{"key":"9297_CR30","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01097060","volume":"7","author":"D. Ratz","year":"1995","unstructured":"Ratz D. and Csendes T. (1995). On the selection of subdivision directions in interval branch-and-bound methods for global optimization. J. Global Optim. 7: 183\u2013207","journal-title":"J. Global Optim."},{"key":"9297_CR31","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01580124","volume":"5","author":"S.M. Robinson","year":"1973","unstructured":"Robinson S.M. (1973). Computable error bounds for nonlinear programming. Math. Program. 5: 235\u2013242","journal-title":"Math. Program."},{"key":"9297_CR32","doi-asserted-by":"crossref","unstructured":"Sahinidis, N.V.: Global optimization and constraint satisfaction: the branch-and-reduce approach. In: Bliek, C., Jermann, C., Neumaier, A. (eds.): COCOS 2002, LNCS, pp. 1\u201316 vol. 2861 (2003)","DOI":"10.1007\/978-3-540-39901-8_1"},{"key":"9297_CR33","first-page":"211","volume":"2861","author":"O. Shcherbina","year":"2003","unstructured":"Shcherbina O., Neumaier A., Sam-Haroud D., Vu X.-H. and Nguyen T.-V. (2003). Benchmarking global optimization and constraint satisfaction codes. LNCS 2861: 211\u2013222","journal-title":"LNCS"},{"key":"9297_CR34","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"E.M.B. Smith","year":"1999","unstructured":"Smith E.M.B. and Pantelides C.C. (1999). A symbolic reformulation\/spatial branch and bound algorithm for the global optimization of nonconvex MINLP\u2019s. Comp. Chem. Eng. 23: 457\u2013478","journal-title":"Comp. Chem. Eng."},{"key":"9297_CR35","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M. Tawarmalani","year":"2004","unstructured":"Tawarmalani M. and Sahinidis N.V. (2004). Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99: 563\u2013591","journal-title":"Math. Program."},{"key":"9297_CR36","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/0377-0427(94)90331-X","volume":"50","author":"M.A. Wolfe","year":"1994","unstructured":"Wolfe M.A. (1994). An interval algorithm for constrained global optimization. J. Comput. Appl. Math. 50: 605\u2013612","journal-title":"J. Comput. Appl. Math."},{"key":"9297_CR37","first-page":"45","volume":"10","author":"O. Yeniay","year":"2004","unstructured":"Yeniay O. (2004). Penalty function methods for constrained optimization with genetic algorithms. Math. Comp. Appl. 10: 45\u201356","journal-title":"Math. Comp. Appl."},{"key":"9297_CR38","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1137\/0806025","volume":"6","author":"J.L. Zhou","year":"1996","unstructured":"Zhou J.L. and Tits A.L. (1996). An SQP algorithm for finely discretized continuous minimax problems and other minimax problems with many objective functions. SIAM J. Optim. 6: 461\u2013487","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-008-9297-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-008-9297-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-008-9297-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T08:12:11Z","timestamp":1559290331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-008-9297-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,27]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["9297"],"URL":"https:\/\/doi.org\/10.1007\/s10898-008-9297-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,27]]}}}