Parallel Hybrid Optimization Methods

Abstract

Given the unconstrained minimization problem

$$f(x)=\min!s.t.x\in{{R}^{n}}$$

(1)

and the nonlinear programming problem

$$f(x) = \min !s.t.x \in {\text{G}}$$

(2)

where $G = \left\{ {x,:{g_{\text{j}}}(x) \leqslant 0{\text{j}} = 1,...,\left. m \right\}.} \right.$