ACM Transactions on Mathematical Software (TOMS)
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Approximate GCDs of polynomials and sparse SOS relaxations
Theoretical Computer Science
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
Computational Optimization and Applications
A prolongation-projection algorithm for computing the finite real variety of an ideal
Theoretical Computer Science
Solutions of polynomial systems derived from the steady cavity flow problem
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Optimization and NP_R-completeness of certain fewnomials
Proceedings of the 2009 conference on Symbolic numeric computation
GloptiPoly 3: moments, optimization and semidefinite programming
Optimization Methods & Software - GLOBAL OPTIMIZATION
Moments and sums of squares for polynomial optimization and related problems
Journal of Global Optimization
Solving polynomial least squares problems via semidefinite programming relaxations
Journal of Global Optimization
Exploiting sparsity in the sum-of-squares approximations to robust semidefinite programs
ACC'09 Proceedings of the 2009 conference on American Control Conference
Partitioning procedure for polynomial optimization
Journal of Global Optimization
Optimizing n-variate (n+k)-nomials for small k
Theoretical Computer Science
A “Joint+Marginal” Approach to Parametric Polynomial Optimization
SIAM Journal on Optimization
Min-max and robust polynomial optimization
Journal of Global Optimization
Positivity and Optimization for Semi-Algebraic Functions
SIAM Journal on Optimization
Convergent SDP-relaxations for polynomial optimization with sparsity
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Maximum Block Improvement and Polynomial Optimization
SIAM Journal on Optimization
Bounded error identification of Hammerstein systems through sparse polynomial optimization
Automatica (Journal of IFAC)
Minimizing ordered weighted averaging of rational functions with applications to continuous location
Computers and Operations Research
Inverse Polynomial Optimization
Mathematics of Operations Research
A convex relaxation approach to set-membership identification of LPV systems
Automatica (Journal of IFAC)
Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity
Journal of Global Optimization
Journal of Global Optimization
An SDP approach for ℓ0-minimization: Application to ARX model segmentation
Automatica (Journal of IFAC)
Hi-index | 0.01 |
We consider a polynomial programming problem $\P$ on a compact basic semialgebraic set $\K\subset\R^n$, described by $m$ polynomial inequalities $g_j(X)\geq0$, and with criterion $f\in\R[X]$. We propose a hierarchy of semidefinite relaxations in the spirit of those of Waki &etal; [SIAM J. Optim., 17 (2006), pp. 218-242]. In particular, the SDP-relaxation of order $r$ has the following two features: (a) The number of variables is $O(\kappa^{2r})$, where $\kappa=\max[\kappa_1,\kappa_2]$ with $\kappa_1$ (resp., $\kappa_2$) being the maximum number of variables appearing in the monomials of $f$ (resp., appearing in a single constraint $g_j(X)\geq0$). (b) The largest size of the linear matrix inequalities (LMIs) is $O(\kappa^r)$. This is to compare with the respective number of variables $O(n^{2r})$ and LMI size $O(n^r)$ in the original SDP-relaxations defined in [J. B. Lasserre, SIAM J. Optim., 11 (2001), pp. 796-817]. Therefore, great computational savings are expected in case of sparsity in the data $\{g_j,f\}$, i.e., when &kgr; is small, a frequent case in practical applications of interest. The novelty with respect to [H. Waki, S. Kim, M. Kojima, and M. Maramatsu, SIAM J. Optim., 17 (2006), pp. 218-242] is that we prove convergence to the global optimum of $\P$ when the sparsity pattern satisfies a condition often encountered in large size problems of practical applications, and known as the running intersection property in graph theory. In such cases, and as a by-product, we also obtain a new representation result for polynomials positive on a compact basic semialgebraic set, a sparse version of Putinar’s Positivstellensatz [M. Putinar, Indiana Univ. Math. J., 42 (1993), pp. 969-984].