{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/19819"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/19819","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Equation-based chemical process optimization on advanced architecture computers","abstract":"The equation-based approach shows great promise as an optimization tool, but its use has been hindered by implementation difficulties. These include problems in providing good automatic initial guesses and excessive computational time on large problems. A prototype chemical process optimization package, SEQUEL-III, is used to consider these issues.","abstract_html":"The equation-based approach shows great promise as an optimization tool, but its use has been hindered by implementation difficulties. These include problems in providing good automatic initial guesses and excessive computational time on large problems. A prototype chemical process optimization package, SEQUEL-III, is used to consider these issues.","abstract_has_math":false,"creators":["Goheen, Christopher Hembrough"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Chemical and Biomolecular Engineering","degree_department":null,"school":null,"contributors":["Stadtherr, Mark A."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:19:36Z","date_published":"2011-05-07T12:19:36Z","updated_at":"2026-07-22T22:25:14Z","subjects":["Engineering, Chemical"],"languages":["eng"],"rights":["Copyright 1992 Goheen, Christopher Hembrough"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9215817","(UMI)AAI9215817"],"render_values":[{"text":"AAI9215817","href":null,"code":true},{"text":"(UMI)AAI9215817","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/19819","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Stadtherr, Mark A."]},{"key":"dc:creator","label":"Author","values":["Goheen, Christopher Hembrough"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:19:36Z","10000-01-01","1992"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Chemical and Biomolecular Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Chemical"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1992 Goheen, Christopher Hembrough"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9215817","(UMI)AAI9215817","http://hdl.handle.net/2142/19819"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The equation-based approach shows great promise as an optimization tool, but its use has been hindered by implementation difficulties. These include problems in providing good automatic initial guesses and excessive computational time on large problems. A prototype chemical process optimization package, SEQUEL-III, is used to consider these issues.","The successive quadratic programming method is applied for the solution of large-scale nonlinear programming problems arising from the equation-based optimization of chemical processes. Since the algorithm updates a full approximate Hessian matrix, a large central memory and vectorization are required for this implementation. The reliability of the program is enhanced with an evolutionary initialization scheme and automatic generation of physically reasonable bounds on the variables. SEQUEL-III has solved a variety of test problems, ranging in size to nearly 1500 variables. For these problems, the optimization takes 2 to 20 times as long as the solution of the related simulation or design problem.","The structure of the occurrence matrix of the Hessian of the Lagrangian is used to consider the sparsity implications involved in solving large-scale problems. This requires that the sparsity be preserved by an augmented Lagrangian or sparse updating technique. In either case, a two-pass approach can be applied for solving the large, sparse linear systems arising at each iteration of the optimization solver. The occurrence matrix is reordered once, then the permuted matrix is solved numerically. Experiments on linear systems generated by an augmented Lagrangian optimization solver show that linear solution techniques which exploit vectorization, positive-definiteness, symmetry, sparsity, or a combination of these features achieve the greatest efficiency, solving some of the larger linear systems on a Cray-2 computer up to 30 times faster than a full solver which does not exploit these features.","Made available in DSpace on 2011-05-07T12:19:36Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9215817.pdf: 4580363 bytes, checksum: 9d5cdeb4e2d20fb690d9b2f55652e454 (MD5) Previous issue date: 1992","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:39:38Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:16:45-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Equation-based chemical process optimization on advanced architecture computers"]}]}],"canonical_facts":{"dc:contributor":["Stadtherr, Mark A."],"dc:creator":["Goheen, Christopher Hembrough"],"dc:date":["2011-05-07T12:19:36Z","10000-01-01","1992"],"dc:description":["The equation-based approach shows great promise as an optimization tool, but its use has been hindered by implementation difficulties. These include problems in providing good automatic initial guesses and excessive computational time on large problems. A prototype chemical process optimization package, SEQUEL-III, is used to consider these issues.","The successive quadratic programming method is applied for the solution of large-scale nonlinear programming problems arising from the equation-based optimization of chemical processes. Since the algorithm updates a full approximate Hessian matrix, a large central memory and vectorization are required for this implementation. The reliability of the program is enhanced with an evolutionary initialization scheme and automatic generation of physically reasonable bounds on the variables. SEQUEL-III has solved a variety of test problems, ranging in size to nearly 1500 variables. For these problems, the optimization takes 2 to 20 times as long as the solution of the related simulation or design problem.","The structure of the occurrence matrix of the Hessian of the Lagrangian is used to consider the sparsity implications involved in solving large-scale problems. This requires that the sparsity be preserved by an augmented Lagrangian or sparse updating technique. In either case, a two-pass approach can be applied for solving the large, sparse linear systems arising at each iteration of the optimization solver. The occurrence matrix is reordered once, then the permuted matrix is solved numerically. Experiments on linear systems generated by an augmented Lagrangian optimization solver show that linear solution techniques which exploit vectorization, positive-definiteness, symmetry, sparsity, or a combination of these features achieve the greatest efficiency, solving some of the larger linear systems on a Cray-2 computer up to 30 times faster than a full solver which does not exploit these features.","Made available in DSpace on 2011-05-07T12:19:36Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9215817.pdf: 4580363 bytes, checksum: 9d5cdeb4e2d20fb690d9b2f55652e454 (MD5) Previous issue date: 1992","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:39:38Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:16:45-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9215817","(UMI)AAI9215817","http://hdl.handle.net/2142/19819"],"dc:language":["eng"],"dc:rights":["Copyright 1992 Goheen, Christopher Hembrough"],"dc:subject":["Engineering, Chemical"],"dc:title":["Equation-based chemical process optimization on advanced architecture computers"],"dc:type":["text"],"thesis:degree_discipline":["Chemical and Biomolecular Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:14Z"}