Technical Note—Bounding Nonconvex Programs by Conjugates

Publisher Website
Google Scholar
Abstract
We point out that the Lagrangian dual conjugation in response space provides a stronger bound and requires less computation than conjugate convexification in decision space. A homotopy is then described to lend economic interpretation in the presence of gaps.

This publication has 0 references indexed in Scilit: