Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
DOI10.1137/060668791zbMath1178.65048arXivmath/0606476OpenAlexW2085045434MaRDI QIDQ3648519
Publication date: 27 November 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0606476
computational complexitynonlinear differential equationsnumerical experimentspolynomialspolynomial systemglobal minimumnonlinear least squaressparsitysum of squaressensor network localization
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10) Nonlinear boundary value problems for ordinary differential equations (34B15) Approximation methods and heuristics in mathematical programming (90C59) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Complexity and performance of numerical algorithms (65Y20)
Related Items (19)
Uses Software
This page was built for publication: Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials