@article{ Cervantes1998,
  abstract = {The differential-algebraic equation (DAE) optimization problem is transformed to a nonlinear programming problem by applying collocation on finite elements. The result- ing problem is solved using a reduced space successive quadratic programming (rSQP) algorithm. Here, the variable space is partitioned into range and null spaces. Partition- ing by choosing a pivot sequence for an LU factorization with partial piuoting allows us to detect unstable modes in the DAE gstem, which can now be stabilized without imposing new boundary conditions. As a result, the range .space is decomposed in a single step by exploiting the overall sparsity of the collocation matrix; which perjoims better than the two-step condensation method used in standard collocation solcers. To deal with ill-conditioned constraints, we also extend the rSQP algorithm to include dogleg steps for the range space step that solves the collocation equations. The per- formance of this algorithm was tested on two well known unstable problems and on three chemical engineering examples including two reactive distillation columns and a plug-frow reactor with free radicals. One of these is u batch column where an equilih- rium reaction takes place. The second reactiue distillation problem is the srartiip qf a continuous column with competitive reactions. These optimization problems, which in- clude more than 150 DAEs, ure solved in less than 7 CPU minutes on workstation class computers.},
  author = {Cervantes, A and Biegler, L T},
  doi = {10.1002/aic.690440505},
  file = {:Users/jboisvert/Library/Application Support/Mendeley Desktop/Downloaded/Cervantes - 1998 - Large‐scale DAE optimization using a simultaneous NLP formulation.pdf:pdf},
  issn = {00011541},
  journal = {AIChE Journal},
  number = {5},
  pages = {1038--1050},
  publisher = {Wiley Subscription Services, Inc., A Wiley Company},
  title = {{Large-scale DAE optimization using a simultaneous NLP formulation}},
  url = {http://doi.wiley.com/10.1002/aic.690440505},
  volume = {44},
  year = {1998}
}

{"_id":{"_str":"534da32e3737571f0d000242"},"__v":1,"authorIDs":[],"author_short":["Cervantes, A.","Biegler","T, L."],"bibbaseid":"cervantes-biegler-t-largescaledaeoptimizationusingasimultaneousnlpformulation-1998","bibdata":{"downloads":0,"bibbaseid":"cervantes-biegler-t-largescaledaeoptimizationusingasimultaneousnlpformulation-1998","urls":{"Paper":"http://doi.wiley.com/10.1002/aic.690440505"},"role":"author","year":"1998","volume":"44","url":"http://doi.wiley.com/10.1002/aic.690440505","type":"article","title":"Large-scale DAE optimization using a simultaneous NLP formulation","publisher":"Wiley Subscription Services, Inc., A Wiley Company","pages":"1038--1050","number":"5","key":"Cervantes1998","journal":"AIChE Journal","issn":"00011541","id":"Cervantes1998","file":":Users/jboisvert/Library/Application Support/Mendeley Desktop/Downloaded/Cervantes - 1998 - Large‐scale DAE optimization using a simultaneous NLP formulation.pdf:pdf","doi":"10.1002/aic.690440505","bibtype":"article","bibtex":"@article{ Cervantes1998,\n abstract = {The differential-algebraic equation (DAE) optimization problem is transformed to a nonlinear programming problem by applying collocation on finite elements. The result- ing problem is solved using a reduced space successive quadratic programming (rSQP) algorithm. Here, the variable space is partitioned into range and null spaces. Partition- ing by choosing a pivot sequence for an LU factorization with partial piuoting allows us to detect unstable modes in the DAE gstem, which can now be stabilized without imposing new boundary conditions. As a result, the range .space is decomposed in a single step by exploiting the overall sparsity of the collocation matrix; which perjoims better than the two-step condensation method used in standard collocation solcers. To deal with ill-conditioned constraints, we also extend the rSQP algorithm to include dogleg steps for the range space step that solves the collocation equations. The per- formance of this algorithm was tested on two well known unstable problems and on three chemical engineering examples including two reactive distillation columns and a plug-frow reactor with free radicals. One of these is u batch column where an equilih- rium reaction takes place. The second reactiue distillation problem is the srartiip qf a continuous column with competitive reactions. These optimization problems, which in- clude more than 150 DAEs, ure solved in less than 7 CPU minutes on workstation class computers.},\n author = {Cervantes, A and Biegler, L T},\n doi = {10.1002/aic.690440505},\n file = {:Users/jboisvert/Library/Application Support/Mendeley Desktop/Downloaded/Cervantes - 1998 - Large‐scale DAE optimization using a simultaneous NLP formulation.pdf:pdf},\n issn = {00011541},\n journal = {AIChE Journal},\n number = {5},\n pages = {1038--1050},\n publisher = {Wiley Subscription Services, Inc., A Wiley Company},\n title = {{Large-scale DAE optimization using a simultaneous NLP formulation}},\n url = {http://doi.wiley.com/10.1002/aic.690440505},\n volume = {44},\n year = {1998}\n}","author_short":["Cervantes, A.","Biegler","T, L."],"author":["Cervantes, A","Biegler","T, L"],"abstract":"The differential-algebraic equation (DAE) optimization problem is transformed to a nonlinear programming problem by applying collocation on finite elements. The result- ing problem is solved using a reduced space successive quadratic programming (rSQP) algorithm. Here, the variable space is partitioned into range and null spaces. Partition- ing by choosing a pivot sequence for an LU factorization with partial piuoting allows us to detect unstable modes in the DAE gstem, which can now be stabilized without imposing new boundary conditions. As a result, the range .space is decomposed in a single step by exploiting the overall sparsity of the collocation matrix; which perjoims better than the two-step condensation method used in standard collocation solcers. To deal with ill-conditioned constraints, we also extend the rSQP algorithm to include dogleg steps for the range space step that solves the collocation equations. The per- formance of this algorithm was tested on two well known unstable problems and on three chemical engineering examples including two reactive distillation columns and a plug-frow reactor with free radicals. One of these is u batch column where an equilih- rium reaction takes place. The second reactiue distillation problem is the srartiip qf a continuous column with competitive reactions. These optimization problems, which in- clude more than 150 DAEs, ure solved in less than 7 CPU minutes on workstation class computers."},"bibtype":"article","biburl":"https://dl.dropboxusercontent.com/u/45574257/proposal.bib","downloads":0,"keywords":[],"search_terms":["large","scale","dae","optimization","using","simultaneous","nlp","formulation","cervantes","biegler","t"],"title":"Large-scale DAE optimization using a simultaneous NLP formulation","year":1998,"dataSources":["BTvm5qqFBGDr7L48m"]}