| dc.creator |
Bardhan, Jaydeep P. |
|
| dc.creator |
Lee, J.H. |
|
| dc.creator |
Kuo, Shihhsien |
|
| dc.creator |
Altman, Michael D. |
|
| dc.creator |
Tidor, Bruce |
|
| dc.creator |
White, Jacob K. |
|
| dc.date |
2003-11-19T21:11:40Z |
|
| dc.date |
2003-11-19T21:11:40Z |
|
| dc.date |
2003-01 |
|
| dc.date.accessioned |
2013-10-09T02:32:09Z |
|
| dc.date.available |
2013-10-09T02:32:09Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/3711 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
We report a Hessian-implicit optimization method to quickly solve the charge optimization problem over protein molecules: given a ligand and its complex with a receptor, determine the ligand charge distribution that minimizes the electrostatic free energy of binding. The new optimization couples boundary element method (BEM) and primal-dual interior point method (PDIPM); initial results suggest that the method scales much better than the previous methods. The quadratic objective function is the electrostatic free energy of binding where the Hessian matrix serves as an operator that maps the charge to the potential. The unknowns are the charge values at the charge points, and they are limited by equality and inequality constraints that model physical considerations, i.e. conservation of charge. In the previous approaches, finite-difference method is used to model the Hessian matrix, which requires significant computational effort to remove grid-based inaccuracies. In the novel approach, BEM is used instead, with precorrected FFT (pFFT) acceleration to compute the potential induced by the charges. This part will be explained in detail by Shihhsien Kuo in another talk. Even though the Hessian matrix can be calculated an order faster than the previous approaches, still it is quite expensive to find it explicitly. Instead, the KKT condition is solved by a PDIPM, and a Krylov based iterative solver is used to find the Newton direction at each step. Hence, only Hessian times a vector is necessary, which can be evaluated quickly using pFFT. The new method with proper preconditioning solves a 500 variable problem nearly 10 times faster than the techniques that must find a Hessian matrix explicitly. Furthermore, the algorithm scales nicely due to the robustness in number of IPM iterations to the size of the problem. The significant reduction in cost allows the analysis of much larger molecular system than those could be solved in a reasonable time using the previous methods. |
|
| dc.description |
Singapore-MIT Alliance (SMA) |
|
| dc.format |
12188 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.relation |
High Performance Computation for Engineered Systems (HPCES); |
|
| dc.subject |
Hessian-implicit optimization |
|
| dc.subject |
bimolecular charge optimization |
|
| dc.subject |
boundary element method |
|
| dc.subject |
primal-dual interior point method |
|
| dc.subject |
Krylov based iterative solver |
|
| dc.title |
Fast Methods for Bimolecular Charge Optimization |
|
| dc.type |
Article |
|