東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Nonlinear process optimization with ...

Poku, Maame Yaa Bosuo.

FindBook

Google Book

Amazon

博客來

Nonlinear process optimization with many degrees of freedom.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Nonlinear process optimization with many degrees of freedom./
作者:	Poku, Maame Yaa Bosuo.
面頁冊數:	222 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-02, Section: B, page: 1036.
Contained By:	Dissertation Abstracts International66-02B.
標題:	Engineering, Chemical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3166281
ISBN:	0542015609

Nonlinear process optimization with many degrees of freedom.
Poku, Maame Yaa Bosuo.

Nonlinear process optimization with many degrees of freedom. - 222 p.

Source: Dissertation Abstracts International, Volume: 66-02, Section: B, page: 1036.

Thesis (Ph.D.)--Carnegie Mellon University, 2005.

This thesis addresses efficient methods in solving large-scale nonlinear problems with many degrees of freedom. Applications of large-scale nonlinear optimization problems with many degrees of freedom have become more common in the process industries, especially in the area of process operations. However, most widely used nonlinear programming (NLP) solvers are designed for the efficient solution of problems with few degrees of freedom. The new barrier algorithm also known as Interior Point Optimization (IPOPT), which follows a primal-dual interior point approach is designed for solving large-scale optimization problems with many degrees of freedom and many potential active constraints set. These large-scale nonlinear optimization problems are nonconvex in nature hence solving for optimal solutions can be extremely challenging. Applicable solvers for these problems need to exploit sparsity in the problem structure which usually requires second order information from the optimization model. Moreover, these methods also need to handle computational difficulties such as redundant (i.e., degenerate) constraints and lack of positive definiteness in the reduced Hessian matrix.

ISBN: 0542015609Subjects--Topical Terms:

1018531
Engineering, Chemical.

Nonlinear process optimization with many degrees of freedom.
LDR:03543nmm 2200301 4500 001 1818307
005 20060908150213.5
008 130610s2005 eng d
020 $a 0542015609
035 $a (UnM)AAI3166281
035 $a AAI3166281
040 $a UnM $c UnM
100 1 $a Poku, Maame Yaa Bosuo. $3 1907645
245 1 0 $a Nonlinear process optimization with many degrees of freedom.
300 $a 222 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-02, Section: B, page: 1036.
500 $a Adviser: Lorenz T. Biegler.
502 $a Thesis (Ph.D.)--Carnegie Mellon University, 2005.
520 $a This thesis addresses efficient methods in solving large-scale nonlinear problems with many degrees of freedom. Applications of large-scale nonlinear optimization problems with many degrees of freedom have become more common in the process industries, especially in the area of process operations. However, most widely used nonlinear programming (NLP) solvers are designed for the efficient solution of problems with few degrees of freedom. The new barrier algorithm also known as Interior Point Optimization (IPOPT), which follows a primal-dual interior point approach is designed for solving large-scale optimization problems with many degrees of freedom and many potential active constraints set. These large-scale nonlinear optimization problems are nonconvex in nature hence solving for optimal solutions can be extremely challenging. Applicable solvers for these problems need to exploit sparsity in the problem structure which usually requires second order information from the optimization model. Moreover, these methods also need to handle computational difficulties such as redundant (i.e., degenerate) constraints and lack of positive definiteness in the reduced Hessian matrix.
520 $a In this research, we focused on solving these large-scale problems based on good initialization strategies and efficient optimization techniques. To demonstrate its effectiveness on process applications, we considered a class of large-scale blending and data reconciliation problems, both of which contained nonlinear mass balance constraints and process properties and compared IPOPT's solver robustness, improved convergence and computational speed with other state of the art popular NLP algorithms. Secondly we evaluated the IPOPT algorithm as one of the solvers in the Rigorous Online Modeling with equation based optimization tool (ROMeo(TM)) to compare the solver's performances with ROMeo(TM)'s in-house successive quadratic programming (SQP) solver OPERA.
520 $a Our final work was performed in developing a new data reconciliation tool, DataRec, designed for reconciling linear data reconciliation measurements problems. The DataRec algorithm follows a Lagrange multiplier method with a modified gross error detection strategy. It uses the Fair function (M-estimator) with an accurate solution and an iterative trust region method for its convergence properties. Since there is no negative curvature of the Hessian matrix i.e., "no hard case", a Levenberg-Marquardt parameter gamma, which is inversely related to the trust region radius Delta is used. The algorithm is tested on several data reconciliation models and results are presented.
590 $a School code: 0041.
650 4 $a Engineering, Chemical. $3 1018531
650 4 $a Engineering, Petroleum. $3 1018448
690 $a 0542
690 $a 0765
710 2 0 $a Carnegie Mellon University. $3 1018096
773 0 $t Dissertation Abstracts International $g 66-02B.
790 1 0 $a Biegler, Lorenz T., $e advisor
790 $a 0041
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3166281