Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    College Park, Md. : American Institute of Physics (AIP)
    The Journal of Chemical Physics 100 (1994), S. 1247-1261 
    ISSN: 1089-7690
    Source: AIP Digital Archive
    Topics: Physics , Chemistry and Pharmacology
    Notes: A deterministic global optimization algorithm is introduced for locating global minimum 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 potential function and the subsequent solution of a series of nonlinear convex optimization problems. The minimization of the total potential energy function is performed on an independent set of internal coordinates involving only dihedral angles. A number of example problems illustrate the proposed approach.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    College Park, Md. : American Institute of Physics (AIP)
    The Journal of Chemical Physics 97 (1992), S. 7667-7678 
    ISSN: 1089-7690
    Source: AIP Digital Archive
    Topics: Physics , Chemistry and Pharmacology
    Notes: A global optimization approach is proposed for finding the global minimum energy configuration of Lennard-Jones microclusters. First, the original nonconvex total potential energy function, composed by rational polynomials, is transformed to the difference of two convex functions (DC transformation) via a novel procedure performed for each pair potential that constitute the total potential energy function. Then, a decomposition strategy based on the global optimization (GOP) algorithm [C. A. Floudas and V. Visweswaran, Comput. Chem. Eng. 14, 1397 (1990); V. Visweswaran and C. A. Floudas, ibid. 14, 1419 (1990); Proc. Process Systems Eng. 1991, I.6.1; C. A. Floudas and V. Visweswaran, J. Opt. Theory Appl. (in press)] is designed to provide tight bounds on the global minimum through the solutions of a sequence of relaxed dual subproblems. A number of theoretical results are included which expedite the computational effort by exploiting the special mathematical structure of the problem. The proposed approach attains ε convergence to the global minimum in a finite number of iterations. Based on this procedure, global optimum solutions are generated for small microclusters n≤7. For larger clusters 8≤N≤24 tight lower and upper bounds on the global solution are provided serving as excellent initial points for local optimization approaches. Finally, improved lower bounds on the minimum interparticle distance at the global minimum are provided.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 7 (1995), S. 143-182 
    ISSN: 1573-2916
    Keywords: Global optimization ; nonlinear systems of equations ; all solutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A new approach is proposed for finding allε-feasible solutions for certain classes of nonlinearly constrained systems of equations. By introducing slack variables, the initial problem is transformed into a global optimization problem (P) whose multiple global minimum solutions with a zero objective value (if any) correspond to all solutions of the initial constrained system of equalities. Allε-globally optimal points of (P) are then localized within a set of arbitrarily small disjoint rectangles. This is based on a branch and bound type global optimization algorithm which attains finiteε-convergence to each of the multiple global minima of (P) through the successive refinement of a convex relaxation of the feasible region and the subsequent solution of a series of nonlinear convex optimization problems. Based on the form of the participating functions, a number of techniques for constructing this convex relaxation are proposed. By taking advantage of the properties of products of univariate functions, customized convex lower bounding functions are introduced for a large number of expressions that are or can be transformed into products of univariate functions. Alternative convex relaxation procedures involve either the difference of two convex functions employed in αBB [23] or the exponential variable transformation based underestimators employed for generalized geometric programming problems [24]. The proposed approach is illustrated with several test problems. For some of these problems additional solutions are identified that existing methods failed to locate.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 42 (1993), S. 85-117 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A primal-relaxed dual global optimization algorithm is presented along with an extensive review for finding the global minimum energy configurations of microclusters composed by particles interacting with any type of two-body central forces. First, the original nonconvex expression for the total potential energy is transformed to the difference of two convex functions (DC transformation) via an eigenvalue analysis performed for each pair potential that constitutes the total potential energy function. Then, a decomposition strategy based on the GOP algorithm [1–4] is designed to provide tight upper and lower bounds on the global minimum through the solutions of a sequence of relaxed dual subproblems. A number of theoretical results are included which expedite the computational effort by exploiting the special mathematical structure of the problem. The proposed approach attainsε-convergence to the global minimum in a finite number of iterations. Based on this procedure global optimum solutions are generated for small Lennard-Jones and Morse (a=3) microclustersn≤7. For larger clusters (8≤N≤24 for Lennard-Jones and 8≤N≤30 for Morse), tight lower and upper bounds on the global solution are provided which serve as excellent initial points for local optimization approaches.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 4 (1994), S. 135-170 
    ISSN: 1573-2916
    Keywords: Molecular Conformations ; Global Minimum Total Potential Energy ; Consistent Convex Lower Bounding ; Exhaustive Subdivision Process ; Bound Improving Selection Operation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A global optimization algorithm is proposed for finding the global minimum potential energy conformations of small molecules. The minimization of the total potential energy is formulated on an independent set of internal coordinates involving only torsion (dihedral) angles. Analytical expressions for the Euclidean distances between non-bonded atoms, which are required for evaluating the individual pairwise potential terms, are obtained as functions of bond lengths, covalent bond angles, and torsion angles. A novel procedure for deriving convex lower bounding functions for the total potential energy function is also introduced. These underestimating functions satisfy a number of important theoretical properties. A global optimization algorithm is then proposed based on an efficient partitioning strategy which is guaranteed to attain ε-convergence to the global minimum potential energy configuration of a molecule through the solution of a series of nonlinear convex optimization problems. Moreover, lower and upper bounds on the total finite number of required iterations are also provided. Finally, this global optimization approach is illustrated with a number of example problems.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Biotechnology and Bioengineering 56 (1997), S. 145-161 
    ISSN: 0006-3592
    Keywords: metabolic pathways ; parametric uncertainty ; chance-constrained programming ; nonlinear optimization ; Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: The S-System formalism provides a popular, versatile and mathematically tractable representation of metabolic pathways. At steady-state, after a logarithmic transformation, the S-System representation reduces into a system of linear equations. Thus, the maximization of a particular metabolite concentration or a flux subject to physiological constraints can be expressed as a linear programming (LP) problem which can be solved explicitly and exactly for the optimum enzyme activities. So far, the quantitative effect of parametric/experimental uncertainty on the S-model predictions has been largely ignored. In this work, for the first time, the systematic quantitative description of modeling/experimental uncertainty is attempted by utilizing probability density distributions to model the uncertainty in assigning a unique value to system parameters. This probabilistic description of uncertainty renders both objective and physiological constraints stochastic, demanding a probabilistic description for the optimization of metabolic pathways. Based on notions from chance-constrained programming and statistics, a novel approach is introduced for transforming the original stochastic formulation into a deterministic one which can be solved with existing optimization algorithms. The proposed framework is applied to two metabolic pathways characterized with experimental and modeling uncertainty in the kinetic orders. The computational results indicate the tractability of the method and the significant role that modeling and experimental uncertainty may play in the optimization of networks of metabolic reactions. While optimization results ignoring uncertainty sometimes violate physiological constraints and may fail to correctly assess objective targets, the proposed framework provides quantitative answers to questions regarding how likely it is to achieve a particular metabolic objective without exceeding a prespecified probability of violating the physiological constraints. Trade-off curves between metabolic objectives, probabilities of meeting these objectives, and chances of satisfying the physiological constraints, provide a concise and systematic way to guide enzyme activity alterations to meet an objective in the face of modeling and experimental uncertainty. © 1997 John Wiley & Sons, Inc. Biotechnol Bioeng 56: 145-161, 1997.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Hoboken, NJ : Wiley-Blackwell
    AIChE Journal 43 (1997), S. 1250-1264 
    ISSN: 0001-1541
    Keywords: Chemistry ; Chemical Engineering
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: A systematic method that quantitatively assesses property prediction uncertainty (imprecision) on optimal molecular design problems is introduced. Propety-structure relations are described with specific nonlinear functionalities based on group contribution methods. Property prediction uncertainty is explicitly quantified by using multivariate probability density distributions to model the likelihood of different realizations of the group contribution parameters. Assuming stability of these probability distributions, a novel approach is introduced for transforming the original nonlinear stochastic formulation into a deterministic MINLP problem with linear binary and convex continuour parts with separability. The resulting convex MINLP formulation is solved to global optimality for molecular design problems involving many uncertain group contribution parameters. Results indicate the computtional tractability of the method and the profound effect that property prediction uncertainty may have in optimal molecular design. Specifically, trade-off curves between performance objectives, probabilities of meeting the objectives, and chances of satisfying design specifications offer a concise and systematic way to guide optimal molecular design in the face of property prediction uncertainty.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...