B-411 Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity

@inproceedings{Waki2004B411SO,
  title={B-411 Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity},
  author={Hayato Waki and Sunyoung Kim and Masakazu Kojima and Masakazu Muramatsu},
  year={2004}
}
Unconstrained and inequality constrained sparse polynomial optimization problems (POPs) are considered. A correlative sparsity pattern graph is defined to find a certain sparse structure in the objective and constraint polynomials of a POP. Based on this graph, sets of supports for sums of squares (SOS) polynomials that lead to efficient SOS and semidefinite programming (SDP) relaxations are obtained. Numerical results from various test problems are included to show the improved performance of… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 106 CITATIONS, ESTIMATED 26% COVERAGE

110 Citations

0510'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 110 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 33 REFERENCES

A convergence hierarchy of LMI relaxations for polynomial matrix inequalities

  • D. Henrion, J. B. Lasserre
  • Laboratoire d’Analyse et d’Architecture des Syst…
  • 2004
Highly Influential
4 Excerpts

Testing a class of methods for solving minimization problems with simple bounds on the variables

  • A. R. Conn, N.I.M. Gould, P. L. Toint
  • Math.Comp.,
  • 1988
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…