Abstract: A key idea for deterministic global optimization is the use of global feasible search, namely, algorithms that guarantee finding feasible solutions of nonconvex problems or prove that none exists. ...

Abstract: Global optimization algorithms for generalized polynomial design models using a global feasible search approach was discussed in a previous article. A new convex cutting plane algorithm (CONCUT) ...

Abstract: A new design optimization method is described for finding global solutions of models with a nonconvex objective function and nonlinear constraints. All functions are assumed to be generalized ...