Molecular structure determination by convex, global underestimation of local energy minima

نویسندگان

  • Andrew T. Phillips
  • J. Ben Rosen
  • Vann Howard Walke
چکیده

The determination of a stable molecular structure can often be formulated in terms of calculating the global (or approximate global) minimum of a potential energy function. Computing the global minimum of this function is very difficult because it typically has a very large number of local minima which may grow exponentially with molecule size. The optimization method presented involves collecting a large number of conformers, each attained by finding a local minimum of the potential energy function from a random starting point. The information from these conformers is then used to form a convex quadratic global underestimating function for the potential energy of all known conformers. This underestimator is an L1 approximation to all known local minima, and is obtained by a linear programming formulation and solution. The minimum of this underestimator is used to predict the global minimum for the function, allowing a localized conformer search to be performed based on the predicted minimum. The new set of conformers generated by the localized search serves as the basis for another quadratic underestimation step in an iterative algorithm. This algorithm has been used to determine the structures of homopolymers of length n ≤ 30 with no sidechains. While it is estimated that there are O(3n) local minima for a chain of length n, this method requires O(n4) computing time on average. It is also shown that the global minimum potential energy values lie on a concave quadratic curve for n ≤ 30. This important property permits estimation of the minimum energy for larger molecules, and also can be used to accelerate the global minimization algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CGU: An Algorithm for Molecular Structure Prediction

A global optimization method is presented for predicting the minimum energy structure of small protein-like molecules. This method begins by collecting a large number of molecular conformations, each obtained by finding a local minimum of a potential energy function from a random starting point. The information from these conformers is then used to form a convex quadratic global underestimating...

متن کامل

Global optimization in protein docking using clustering, underestimation and semidefinite programming

The underestimation of data points by a convex quadratic function is a useful tool for approximating the location of the global minima of potential energy functions that arise in protein-ligand docking problems. Determining the parameters that define the underestimator can be formulated as a convex quadratically constrained quadratic program and solved efficiently using algorithms for semidefin...

متن کامل

Multi-funnel optimization using Gaussian underestimation

In several applications, underestimation of functions has proven to be a helpful tool for global optimization. In protein-ligand docking problems as well as in protein structure prediction, single convex quadratic underestimators have been used to approximate the location of the global minimum point. While this approach has been successful for basin-shaped functions, it is not suitable for ener...

متن کامل

Convex Kernel Underestimation of Functions with Multiple Local Minima

A function on R with multiple local minima is approximated from below, via linear programming, by a linear combination of convex kernel functions using sample points from the given function. The resulting convex kernel underestimator is then minimized, using either a linear equation solver for a linear-quadratic kernel or by a Newton method for a Gaussian kernel, to obtain an approximation to a...

متن کامل

A deterministic global optimization approach for molecular structure determination

A deterministic global optimization algorithm is introduced for locating global mInlmUm potential energy molecular conformations. The proposed branch and bound type algorithm attains finite €-convergence to the global minimum through the successive refinement of converging lower and upper bounds on the solution. These bounds are obtained through a novel convex lowering bounding of the total pot...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995