Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10107-004-0554-3 | Math. Program. |
Keywords | Field | DocType |
semidefinite program,effective method,nonnegative multivariate polynomial,sum of squares of polynomial,squares optimization,recent development,essential subject,semidefinite programming,polynomial optimization problem,sparsity,simpler representation,sparse polynomial,sums,sum of squares | Discrete mathematics,Mathematical optimization,Power sum symmetric polynomial,Classical orthogonal polynomials,Polynomial matrix,Elementary symmetric polynomial,Residual sum of squares,Symmetric polynomial,Explained sum of squares,Mathematics,Difference polynomials | Journal |
Volume | Issue | ISSN |
103 | 1 | 1436-4646 |
Citations | PageRank | References |
40 | 3.79 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masakazu Kojima | 1 | 1603 | 222.51 |
| Sunyoung Kim | 2 | 461 | 38.82 |
| Hayato Waki | 3 | 376 | 28.82 |