Sparsity in sums of squares of polynomials

• 成果类型: Article
• 署名作者: Kojima, M; Kim, S; Waki, H
• 署名单位: Institute of Science Tokyo; Tokyo Institute of Technology; Ewha Womans University
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-004-0554-3
• 发表日期: 2005
• 页码: 45-62
• 关键词: Optimization

摘要

Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of sums of squares optimization and semidefinite programming (SDP) relaxation of polynomial optimization problems. We discuss effective methods to obtain a simpler representation of a sparse polynomial as a sum of squares of sparse polynomials by eliminating redundancy.