Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/48643
Title: Interior-point methods for minimization of potential energy functions of polypeptides
Authors: MUTHU SOLAYAPPAN
Keywords: Interior point methods, nonconvex nonlinear programming, barrier function, box constraints, potential energy minimization, peptides
Issue Date: 12-Aug-2011
Source: MUTHU SOLAYAPPAN (2011-08-12). Interior-point methods for minimization of potential energy functions of polypeptides. ScholarBank@NUS Repository.
Abstract: Interior-point methods to minimize nonlinear, nonconvex potential energy function of proteins constrained by the bounds on dihedral angles are proposed. The first approach uses a barrier function to transform the original problem into a sequence of subproblems. First-order necessary conditions are used to generate the direction of descent for the subproblem being solved. The second approach utilizes the term for Lennard-Jones 6-12 potential in the energy function as the barrier function. The two proposed solution approaches have been utilized to solve a number of polypeptide structures. The performance of the solution methods is compared with that of a genetic algorithm implementation and other methods from the literature. The comparison shows the proposed approaches to be computationally inexpensive and capable of providing good quality solutions. The proposed solution approaches can be adapted and extended to solve optimization problems arising out of other areas such as molecular structure prediction and peptide docking.
URI: http://scholarbank.nus.edu.sg/handle/10635/48643
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
SolayappanM.pdf1.82 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

64
checked on Dec 11, 2017

Download(s)

131
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.