## A Primal-Relaxed Dual Global Optimization Approach (1993)

Citations: | 44 - 20 self |

### BibTeX

@MISC{Floudas93aprimal-relaxed,

author = {C. A. Floudas and V. Visweswaran},

title = {A Primal-Relaxed Dual Global Optimization Approach},

year = {1993}

}

### Years of Citing Articles

### OpenURL

### Abstract

A deterministic global optimization approach is proposed for nonconvex constrained nonlinear programming problems. Partitioning of the variables, along with the introduction of transformation variables, if necessary, convert the original problem into primal and relaxed dual subproblems that provide valid upper and lower bounds respectively on the global optimum. Theoretical properties are presented which allow for a rigorous solution of the relaxed dual problem. Proofs of ffl-finite convergence and ffl-global optimality are provided. The approach is shown to be particularly suited to (a) quadratic programming problems, (b) quadratically constrained problems, and (c) unconstrained and constrained optimization of polynomial and rational polynomial functions. The theoretical approach is illustrated through a few example problems. Finally, some further developments in the approach are briefly discussed.