{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T18:19:28Z","timestamp":1695579568450},"reference-count":24,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0305-0548(03)00045-5","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"941-962","source":"Crossref","is-referenced-by-count":3,"title":["Active set strategies in an ellipsoid algorithm for nonlinear programming"],"prefix":"10.1016","volume":"31","author":[{"given":"Edgar K.","family":"Rugenstein","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kupferschmid","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00045-5_BIB1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01071394","article-title":"Cut-off method with space extension in convex programming problems","volume":"12","author":"Shor","year":"1977","journal-title":"Cybernetics"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB2","series-title":"Introduction to operations research","author":"Ecker","year":"1988"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB3","unstructured":"Shah S. An ellipsoid algorithm for equality-constrained nonlinear programs. Phd dissertation, Rensselaer Polytechnic Institute, Troy, NY, 1998."},{"key":"10.1016\/S0305-0548(03)00045-5_BIB4","unstructured":"Rugenstein EK. Active set strategies and an ellipsoid algorithm for general nonlinear programming problems. Phd dissertation, Rensselaer Polytechnic Institute, Troy, NY, 2002."},{"key":"10.1016\/S0305-0548(03)00045-5_BIB5","unstructured":"Dziuban ST. Ellipsoid algorithm variants in nonlinear programming. Phd dissertation, Rensselaer Polytechnic Institute, Troy, NY, 1983."},{"key":"10.1016\/S0305-0548(03)00045-5_BIB6","series-title":"Linear optimization and extensions: theory and algorithms","author":"Fang","year":"1993"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB7","unstructured":"Eason ED, Fenton RG. Testing and evaluation of numerical methods for design optimization. UTME-TP 7204. Toronto, Ont., Canada: University of Toronto, 1972."},{"key":"10.1016\/S0305-0548(03)00045-5_BIB8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Programming Ser. A"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/355826.355833","article-title":"On reporting computational experiments with mathematical software","volume":"5","author":"Crowder","year":"1979","journal-title":"ACM Trans Math Software"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB10","article-title":"Test examples for nonlinear programming","volume":"vol. 187","author":"Hock","year":"1981"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB11","unstructured":"Colville AR. A comparative study on nonlinear programming codes. New York Scientific Center Report 320-2949. New York: International Business Machines, 1968."},{"key":"10.1016\/S0305-0548(03)00045-5_BIB12","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/BF01580667","article-title":"A set of geometric programming test problems and their solutions","volume":"10","author":"Dembo","year":"1976","journal-title":"Math Programming"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB13","series-title":"Applied nonlinear programming","author":"Himmelblau","year":"1972"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB14","series-title":"Comparison of generalized geometric programming algorithms. Advances in geometric programming","author":"Rijckaert","year":"1980"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB15","series-title":"Handbook of test problems in local and global optimization","author":"Floudas","year":"1999"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB16","series-title":"Optimality in nonlinear programming","author":"Ben-Israel","year":"1981"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB17","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1147\/rd.165.0504","article-title":"Widely convergent method for finding multiple solutions of simultaneous equations","volume":"16","author":"Branin","year":"1972","journal-title":"IBM J Res Dev"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB18","series-title":"Selected applications of nonlinear programming","author":"Bracken","year":"1968"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB19","series-title":"Nonlinear programming theory and algorithms","author":"Bazaraa","year":"1993"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01582066","article-title":"Global minimization by reducing the duality gap","volume":"63","author":"Ben-Tal","year":"1994","journal-title":"Math Programming"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01589332","article-title":"Methods for minimax optimization","volume":"20","author":"Hald","year":"1981","journal-title":"Math Programming"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB22","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/mnsc.21.6.658","article-title":"A geometric programming model for optimal allocation of stream dissolved oxygen","volume":"21","author":"Ecker","year":"1975","journal-title":"Manage Sci"},{"key":"10.1016\/S0305-0548(03)00045-5_BIB23","unstructured":"Wong KP. Decentralized planning by vertical decomposition of an economic system: a nonlinear programming approach. Phd dissertation, National Economic Planning Institute, University of Birmingham, Birmingham, England, 1970."},{"key":"10.1016\/S0305-0548(03)00045-5_BIB24","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0323042","article-title":"A computational comparison of the ellipsoid algorithm with several nonlinear programming algorithms","volume":"23","author":"Ecker","year":"1985","journal-title":"SIAM J Control Optim"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000455?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000455?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T06:41:00Z","timestamp":1682491260000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0305054803000455"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00045-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}