Item

On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems

de Klerk,E.
; 
Laurent,M.
Abstract
The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a new proof of the finite convergence property under weaker assumptions than were known before. In addition, we show that—under the assumptions for finite convergence—the number of steps needed for convergence depends on more than the input size of the problem.
Description
Date
2011
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
de Klerk, E & Laurent, M 2011, 'On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems', SIAM Journal on Optimization, vol. 21, no. 3, pp. 824-832. < http://epubs.siam.org/siopt/resource/1/sjope8/v21/i3/p824_s1 >
URI
https://hdl.handle.net/20.500.14602/55481
License
info:eu-repo/semantics/restrictedAccess
Embedded videos