Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Functions minimization

Fletcher R and Reeves C M 1964 Function minimization by conjugate gradients Comput. J. 7 149... [Pg.2356]

The problem is one of constrained functional minimization, and has several approaches. [Pg.272]

It can be shown that the constrained functional minimization of equation (9.48) yields again the matrix Riccati equations (9.23) and (9.25) obtained for the LQR, combined with the additional set of reverse-time state tracking equations... [Pg.280]

The conjugate gradient method [25] is used to minimize the function Minimization is done with respect to for a given value... [Pg.695]

The basic backpiopagation algorithm described above is, in practice, often very slow to converge. Moreover, just as Hopfield nets can sometimes get stuck in undesired spurious attractor states (i.e. local minima see section 10.6.5), so to can multilayer perceptrons get trapped in some undesired local minimum state. This is an unfortunate artifact that plagues all energy (or cost-function) minimization schemes. [Pg.544]

To determine the optimal parameters, traditional methods, such as conjugate gradient and simplex are often not adequate, because they tend to get trapped in local minima. To overcome this difficulty, higher-order methods, such as the genetic algorithm (GA) can be employed [31,32]. The GA is a general purpose functional minimization procedure that requires as input an evaluation, or test function to express how well a particular laser pulse achieves the target. Tests have shown that several thousand evaluations of the test function may be required to determine the parameters of the optimal fields [17]. This presents no difficulty in the simple, pure-state model discussed above. [Pg.253]

Step 3. Learning Step Solve the objective function minimization problem with respect to the weights c (and the coefficients, w, if not defined in the previous step). [Pg.170]

The state updating functions combine information about the constraints on the state variables with the objective function minimization. The feasibility predicate forces the state variables to obey certain constraints, such as the nonoverlap of batches, forcing the start-times of successive operations to be greater than the end-times of the previous operation. The constraints do not force the start-times to be equal to the previous... [Pg.287]

Nash, J. C. Compact Numerical Methods for Computers Linear Algebra and Function Minimization John Willey and Sons, New York, 1979. [Pg.128]

The goals of therapy are to prevent further loss of visual function minimize adverse effects of therapy and its impact on the patient s vision, general health, and quality of life control intraocular pressure in order to reduce or prevent further optic nerve damage and educate and involve the patient in the management of their disease. [Pg.909]

Shanno, D. F. Conditioning of Quasi-Newton Methods for Function Minimization. Math Comput 24 647-657 (1970). [Pg.211]

Broyden, C. G. Quasi-Newton Methods and Their Application to Function Minimization Math Comput 21 368 (1967). [Pg.211]

One can be easily convinced that this prescription is correct, if one compares the variation of the functionals minimized in Eqs. (87) and (64) the last minimization being equivalent to that in Eq. (28), solved via Eq. (33). Because the effective external potential (89) depends functionally on n r), an iterative method, leading to self-consistency, must be employed. [Pg.72]

Functional Taylor series expansion of the functional minimized in Eq. (87), in powers of noK ") = [nGs( ) - gs( )] has been employed first, and Eq. (88) used in the last step. So E " is close to KS correlation energy functional taken for the GS density of HF approximation, corrected by the (much smaller) HF correlation energy, and a small remainder of the second order in the density difference. The last quantity gives an estimate to the large parentheses term of Eq. (28) in [12]. [Pg.72]

Next, when we compare the variation of the functional minimized in Eq. (108) with that in Eq. (101), we conclude that the exact GS problem can be solved by algorithms of the OP method, if an OP effective external potential... [Pg.75]

Advantages include less sedation (preferable in elderly), less effect on psychomotor and psychological function, minimal propensity to interact with ethanol and other CNS depressants... [Pg.165]

Gene function Minimal DNA celC Simple-ribosome cell Extremely reduced cell... [Pg.253]

IB J.A. Nelder and R. Mead, A simplex method for function minimization,... [Pg.138]

J.A.Nelder R.Mead A Simplex Method for Function Minimization. Computer Journal, 7. 308-313, (1965). [Pg.235]


See other pages where Functions minimization is mentioned: [Pg.349]    [Pg.319]    [Pg.288]    [Pg.111]    [Pg.72]    [Pg.398]    [Pg.192]    [Pg.41]    [Pg.138]    [Pg.210]    [Pg.211]    [Pg.91]    [Pg.171]    [Pg.105]    [Pg.73]    [Pg.88]    [Pg.316]    [Pg.319]    [Pg.112]    [Pg.241]    [Pg.40]    [Pg.111]    [Pg.314]    [Pg.50]    [Pg.27]    [Pg.135]    [Pg.190]    [Pg.6]    [Pg.296]   
See also in sourсe #XX -- [ Pg.52 ]




SEARCH



Barrier function, minimization

Energy dissipation function minimization

Existence of an energy functional minimized by po

Functional cost, minimizing

Functional minimization

Minimal function value

Minimal metabolic functionality

Minimal metabolic functionality designed strain

Minimal metabolic functionality identification

Minimal metabolic functionality selection

Minimal-basis-set wave function

Minimization Penalty and Barrier Functions

Minimization of functions

Minimizing functional

Minimizing functional

Penalty function, minimization

Potential energy function determination minimal expansion

Potential energy function minimization

Potential functions minimization

Quadratic function minimization

Rational function minimization

Rietveld method minimized function

Target function minimization

© 2024 chempedia.info