Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness

V. Jeyakumar; T. S. Phạm; G. Li

Year of publication:	2014
Authors:	Jeyakumar, Vaithilingam ; Phạm, T. S. ; Li, Guoyin
Published in:	Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 42.2014, 1, p. 34-40
Subject:	Convex polynomial optimization \| Sums-of-squares of polynomials \| Semidefinite programming \| Mathematische Optimierung \| Mathematical programming \| Theorie \| Theory

Check Google Scholar |

More access options

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10010259257

A service of the