Wyniki wyszukiwania:

Part III presents direct search methods (Generalized Pattern Search and Mesh Adaptive Direct Search) and Part IV focuses on model-based methods (Simplex Gradient and Trust Region).

Global optimization aims at solving the most general problem of deterministic mathematical programming: to find the global optimum of a nonlinear, nonconvex, multivariate function of continuous and/or integer variables subject to constraints which may be themselves nonlinear and nonconvex. In addition, once the solution is found, proof of its optimality is also expected from this methodology. ESSAYS AND SURVEYS IN GLOBAL OPTIMIZATION is the most recent examination of its mathematical capability, power, and wide ranging solution to many fields in the applied sciences.

...

Global optimization aims at solving the most general problem of deterministic mathematical programming: to find the global optimum of a nonlinear, nonconvex, multivariate function of continuous and/or integer variables subject to constraints which may be themselves nonlinear and nonconvex. In addition, once the solution is found, proof of its optimality is also expected from this methodology. ESSAYS AND SURVEYS IN GLOBAL OPTIMIZATION is the most recent examination of its mathematical capability, power, and wide ranging solution to many fields in the applied sciences.

...