“optimization”的概念、定义、翻译、参考文献-科学参考

optimization

Mathematics

The process of finding the best possible solution to a problem. In mathematics, this often consists of maximizing or minimizing the value of a certain function, perhaps subject to given constraints. Compare constrained optimization.

Statistics

The minimization or maximization of some function, usually subject to restrictions (which are often on the values of the variables over which the optimization takes place).

Chemical Engineering

A procedure or set of procedures used to find the best compromise or optimal solution to a problem between conflicting requirements. Solved mathematically, it can be used to maximize or minimize a mathematical functional within defined constraints. For example, it can be used to maximize the yield from a chemical reaction or the revenue generated from a process while minimizing the consumption of energy, production of a by-product, or waste.

Computer

The process of finding the best solution to some problem, where ‘best’ accords to prestated criteria. The word is used in a number of contexts.
1. In mathematics the word is generally used to describe the theory and practice of maximizing, or minimizing, a function (known as an objective function) of several variables that may be subject to a set of constraints. The special case of a linear objective function is the subject of linear programming. The case of nonlinear objective functions, with or without constraints, is treated in a quite well-developed field. The unconstrained optimization problem (usually expressed as minimization) is:
$minimize f (x)$
where f(x) is the given objective function of n real variables,
$x = {(x_{1}, x_{2}, \dots, x_{n})}^{T}$
A necessary condition for a minimum is that
$\partial f / \partial x_{i} = 0, i = 1, 2, \dots, n$
which is a system of nonlinear equations. Newton’s method can be applied, but in practice this technique has been extensively modified to improve computational efficiency. Matrix-updating methods are a broad class of methods that involve a sophisticated means of computing approximations to the matrices required in Newton’s method.
For constrained problems, x must also satisfy a system (possibly nonlinear) of equations or inequalities. Some of the ideas and methods for unconstrained problems can be suitably modified to handle the constraints. A successful technique is sequential quadratic programming.
Optimization problems are widespread in control theory, chemical engineering, and many other fields.
2. In programming the word is usually applied to part of the code-generation phase of a compiler, denoting production of object code that is in some sense optimal, i.e. making best use of the resources provided by the target machine, or at least using these resources in a manner that is not blatantly wasteful. Programs can be space-efficient in the sense of occupying minimal storage, or time-efficient in the sense of executing in the minimum time.
Compiler optimization is usually directed toward generating time-efficient programs, and takes three forms. Global optimization seeks to reorder the sequencing of a program so as to eliminate redundant computations (moving invariant operations outside loop bodies, coalescing loops, etc.). Register optimization adjusts the allocation of machine registers to variables and intermediate quantities in such a way as to minimize the number of occasions on which a register has to be stored and later reloaded. Local (peephole) optimization seeks to adapt the code to exploit particular features of the machine architecture and to remove local mishandling such as loading a register with a value that it already contains.

Economics

In economics, the choice from all possible uses of resources of that which gives the best result. This is often represented by the maximization of benefits or the minimization of losses; in general, the objective function describes what is to be optimized. The set of potential choices may be unlimited (unconstrained optimization) or limited (constrained optimization) by resource scarcity, budget constraint, or legal barriers.

单词	optimization
释义	optimization Mathematics The process of finding the best possible solution to a problem. In mathematics, this often consists of maximizing or minimizing the value of a certain function, perhaps subject to given constraints. Compare constrained optimization. Statistics The minimization or maximization of some function, usually subject to restrictions (which are often on the values of the variables over which the optimization takes place). Chemical Engineering A procedure or set of procedures used to find the best compromise or optimal solution to a problem between conflicting requirements. Solved mathematically, it can be used to maximize or minimize a mathematical functional within defined constraints. For example, it can be used to maximize the yield from a chemical reaction or the revenue generated from a process while minimizing the consumption of energy, production of a by-product, or waste. Computer The process of finding the best solution to some problem, where ‘best’ accords to prestated criteria. The word is used in a number of contexts. 1. In mathematics the word is generally used to describe the theory and practice of maximizing, or minimizing, a function (known as an objective function) of several variables that may be subject to a set of constraints. The special case of a linear objective function is the subject of linear programming. The case of nonlinear objective functions, with or without constraints, is treated in a quite well-developed field. The unconstrained optimization problem (usually expressed as minimization) is: $minimize f (x)$ where f(x) is the given objective function of n real variables, $x = {(x_{1}, x_{2}, \dots, x_{n})}^{T}$ A necessary condition for a minimum is that $\partial f / \partial x_{i} = 0, i = 1, 2, \dots, n$ which is a system of nonlinear equations. Newton’s method can be applied, but in practice this technique has been extensively modified to improve computational efficiency. Matrix-updating methods are a broad class of methods that involve a sophisticated means of computing approximations to the matrices required in Newton’s method. For constrained problems, x must also satisfy a system (possibly nonlinear) of equations or inequalities. Some of the ideas and methods for unconstrained problems can be suitably modified to handle the constraints. A successful technique is sequential quadratic programming. Optimization problems are widespread in control theory, chemical engineering, and many other fields. 2. In programming the word is usually applied to part of the code-generation phase of a compiler, denoting production of object code that is in some sense optimal, i.e. making best use of the resources provided by the target machine, or at least using these resources in a manner that is not blatantly wasteful. Programs can be space-efficient in the sense of occupying minimal storage, or time-efficient in the sense of executing in the minimum time. Compiler optimization is usually directed toward generating time-efficient programs, and takes three forms. Global optimization seeks to reorder the sequencing of a program so as to eliminate redundant computations (moving invariant operations outside loop bodies, coalescing loops, etc.). Register optimization adjusts the allocation of machine registers to variables and intermediate quantities in such a way as to minimize the number of occasions on which a register has to be stored and later reloaded. Local (peephole) optimization seeks to adapt the code to exploit particular features of the machine architecture and to remove local mishandling such as loading a register with a value that it already contains. Economics In economics, the choice from all possible uses of resources of that which gives the best result. This is often represented by the maximization of benefits or the minimization of losses; in general, the objective function describes what is to be optimized. The set of potential choices may be unlimited (unconstrained optimization) or limited (constrained optimization) by resource scarcity, budget constraint, or legal barriers.
随便看	Z axis z-axis Zaïre Z boson Z-buffer ZC Z Camelopardalis star ZD zdf Zealots zeatin Zechstein Zechstein Sea Zeckendorf’s theorem Zedian Zeebrugge raid (23 April 1918) Zeeman effect Zeeman, Pieter Zeeman, Sir Erik Christopher (1925–2016) Zeilinger’s principle Zeisel reaction Zeise’s salt Zeiss, Carl (1816–88) Zelenchukskaya Zelen, Marvin (1927–2014)