Journal of Optimization Theory and Applications

, Volume 78, Issue 2, pp 187–225

Primal-relaxed dual global optimization approach

  • C. A. Floudas
  • V. Visweswaran
Contributed Papers

DOI: 10.1007/BF00939667

Cite this article as:
Floudas, C.A. & Visweswaran, V. J Optim Theory Appl (1993) 78: 187. doi:10.1007/BF00939667

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, converts 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 ∈-finite convergence and ∈-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.

Key Words

Global optimizationquadratic programmingpolynomial functions∈-optimal solutions

Copyright information

© Plenum Publishing Corporation 1993

Authors and Affiliations

  • C. A. Floudas
    • 1
  • V. Visweswaran
    • 1
  1. 1.Department of Chemical EngineeringPrinceton UniversityPrinceton