Hidden Convexity in Partially Separable Optimization

A. Ben-Tal, D. den Hertog, M. Laurent

Research output: Working paperDiscussion paperOther research output

Abstract

The paper identifies classes of nonconvex optimization problems whose convex relaxations have optimal solutions which at the same time are global optimal solutions of the original nonconvex problems. Such a hidden convexity property was so far limited to quadratically constrained quadratic problems with one or two constraints. We extend it here to problems with some partial separable structure. Among other things, the new hidden convexity results open up the possibility to solve multi-stage robust optimization problems using certain nonlinear decision rules.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Volume2011-070
Publication statusPublished - 2011

Publication series

NameCentER Discussion Paper
Volume2011-070

Keywords

  • convex relaxation of nonconvex problems
  • hidden convexity
  • partially separable functions
  • robust optimization

Fingerprint Dive into the research topics of 'Hidden Convexity in Partially Separable Optimization'. Together they form a unique fingerprint.

Cite this