Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Hayato Waki Tokyo Institute of Technology
Sunyoung Kim Ewha W. University
Masakazu Kojima Tokyo Institute of Technology
Masakazu Muramatsu The University of Electro-Communications
Hiroshi Sugimoto Tokyo Institute of Technology
Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems Published by ACM 2008 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 74
· Downloads (cumulative): 357
· Citation Count: 10

Published in:
Cover Image
 
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 35 Issue 2, July 2008
Article No. 15
ACM New York, NY, USA
table of contents doi>10.1145/1377612.1377619

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder