On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems

Published 2011 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
Authors
Keywords
-
Journal
SIAM JOURNAL ON OPTIMIZATION
Volume 21, Issue 3, Pages 824-832
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2011-09-02
DOI
10.1137/100814147

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.