Some symmetries of time-dependent Schrödinger equations for inverse quadratic, linear, and quadratic potentials have been systematically examined by using a method suitable to the problem. Especially, the symmetry group for the case of the linear potential turns out to be a semi-direct product SL(2, R) j s T2(R) of the SL(2, R) with a two-dimensional real translation group T2(R). Here, the time...

in this paper, we have outlined the surrogate management framework for optimization of expensive functions. an initial simple iterative method which we call the “strawman” method illustrates how surrogates can be incorporated into optimization to stand in for the most expensive function. these ideas are made rigorous by incorporating them into the framework of pattern search methods. the smf al...

Multilevel representations have been studied extensively by arti cial intelligence researchers. We present a general method that utilizes the multilevel paradigm to attack the problem of performing multidiscipline engineering design optimization in the presence of many local optima. The method uses a multidisciplinary simulator at multiple levels of abstraction, paired with a multilevel search ...

Production optimization involves the determination of optimum well controls to maximize an objective function such as cumulative oil production or net present value. In practice, this problem additionally requires the satisfaction of physical and economic constraints. Thus the overall problem represents a challenging nonlinearly constrained optimization. This work entails a comparative study of...

We consider the numerical treatment of the optical flow problem by evaluating the performance of the trust region method versus the line search method. To the best of our knowledge, the trust region method is studied here for the first time for variational optical flow computation. Four different optical flow models are used to test the performance of the proposed algorithm combining linear and...

routines for approximate solution of dense quadratic assignment problems A greedy randomized adaptive search procedure for the quadratic assignment problem, in Quadratic assign-for approximate solution of sparse quadratic assignment problems using