Resource title

A Class of Problems where Dual Bounds Beat Underestimation Bounds

Resource image

image for OpenScout resource :: A Class of Problems where Dual Bounds Beat Underestimation Bounds

Resource description

We investigate the problem of minimizing a nonconvex function with respect to convex constraints, and we study different techniques to compute a lower bound on the optimal value: The method of using convex envelope functions on one hand, and the method of exploiting nonconvex duality on the other hand. We investigate which technique gives the better bound and develop conditions under which the dual bound is strictly better than the convex envelope bound. As a byproduct, we derive some interesting results on nonconvex duality. (author's abstract) ; Series: Forschungsberichte / Institut für Statistik

Resource author

Mirjam Dür

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://epub.wu.ac.at/1468/1/document.pdf

Resource license

Adapt according to the license agreement. Always reference the original source and author.