Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars

doi:10.1145/1390768.1390792

Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars

Full Text:

PDF

Buy this Article

Authors:	Erich Kaltofen	NCSU, Raleigh, NC, USA
	Bin Li	AMSS, Beijing, China
	Zhengfeng Yang	NCSU, Raleigh, NC, USA
	Lihong Zhi	AMSS, Beijing, China

	2008 Article
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 14 · Downloads (cumulative): 113 · Citation Count: 14

Published in:

	· Proceeding
	ISSAC '08 Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
	Pages 155-164 ACM New York, NY, USA ©2008 table of contents ISBN: 978-1-59593-904-3 doi>10.1145/1390768.1390792

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- ISSAC'13

Tags: algebraic algorithms algorithms approximate factorization experimentation global optimization hybrid method semidefinite programming sum-of-squares validated output

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