Semidefinite programming relaxations for semialgebraic problems
From MaRDI portal
Publication:1424271
DOI10.1007/s10107-003-0387-5zbMath1043.14018DBLPjournals/mp/Parrilo03OpenAlexW1967184028WikidataQ93515461 ScholiaQ93515461MaRDI QIDQ1424271
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0387-5
Semidefinite programming (90C22) Integer programming (90C10) Semialgebraic sets and related spaces (14P10) Real algebra (13J30)
Related Items (only showing first 100 items - show all)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure ⋮ Some applications of polynomial optimization in operations research and real-time decision making ⋮ Nonlinear analysis of vehicle control actuations based on controlled invariant sets ⋮ Independent sets in semi-random hypergraphs ⋮ A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding ⋮ Sum of squares method for sensor network localization ⋮ Moments and sums of squares for polynomial optimization and related problems ⋮ Symmetry in Turán sums of squares polynomials from flag algebras ⋮ On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors ⋮ Set-membership errors-in-variables identification of MIMO linear systems ⋮ Semidefinite programming and sums of Hermitian squares of noncommutative polynomials ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Global completability with applications to self-consistent quantum tomography ⋮ Sums of squares on the hypercube ⋮ A copositive formulation for the stability number of infinite graphs ⋮ Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals ⋮ Real ideal and the duality of semidefinite programming for polynomial optimization ⋮ Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials ⋮ Semidefinite representations for finite varieties ⋮ Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity ⋮ Facial reduction algorithms for conic optimization problems ⋮ Exact asymptotic stability analysis and region-of-attraction estimation for nonlinear systems ⋮ Partitioning procedure for polynomial optimization ⋮ Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming ⋮ An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones ⋮ On the Kalman-Yakubovich-Popov lemma and the multidimensional models ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization ⋮ SOS approximations of nonnegative polynomials via simple high degree perturbations ⋮ Linear-quadratic control and quadratic differential forms for multidimensional behaviors ⋮ A facial reduction algorithm for finding sparse SOS representations ⋮ Integral quadratic constraints for delayed nonlinear and parameter-varying systems ⋮ POS3POLY -- a MATLAB preprocessor for optimization with positive polynomials ⋮ Copositivity and constrained fractional quadratic problems ⋮ Optimal voting rules for two-member tenure committees ⋮ Border basis relaxation for polynomial optimization ⋮ Some geometric properties of successive difference substitutions ⋮ Set-membership estimation of fiber laser physical parameters from input-output power measurements ⋮ On the performance of nonlinear dynamical systems under parameter perturbation ⋮ Change-of-bases abstractions for non-linear hybrid systems ⋮ Copositive optimization -- recent developments and applications ⋮ Stability analysis of polynomial fuzzy models via polynomial fuzzy Lyapunov functions ⋮ An optimization approach to weak approximation of stochastic differential equations with jumps ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Global stability analysis of fluid flows using sum-of-squares ⋮ Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) ⋮ Efficient and accurate computation of upper bounds of approximation errors ⋮ Obtaining certificates for complete synchronisation of coupled oscillators ⋮ A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs ⋮ SAT modulo linear arithmetic for solving polynomial constraints ⋮ Equilibrium-independent passivity: a new definition and numerical certification ⋮ Controller synthesis for robust invariance of polynomial dynamical systems using linear programming ⋮ Tunable halfband-pair wavelet filter banks and application to multifocus image fusion ⋮ Robust control of uncertain systems: classical results and recent developments ⋮ Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz ⋮ A Frank-Wolfe type theorem for nondegenerate polynomial programs ⋮ A computational approach to synthesizing guards for hybrid systems ⋮ A probabilistic symbolic algorithm to find the minimum of a polynomial function on a basic closed semialgebraic set ⋮ Discriminants and nonnegative polynomials ⋮ Positive semidefinite diagonal minus tail forms are sums of squares ⋮ First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials ⋮ Exploiting equalities in polynomial programming ⋮ Algorithms for multidimensional spectral factorization and sum of squares ⋮ Analysis of autocatalytic networks in biology ⋮ Robust stability and instability of biochemical networks with parametric uncertainty ⋮ A refined error analysis for fixed-degree polynomial optimization over the simplex ⋮ Exact relaxations of non-convex variational problems ⋮ Cross-Hill: a heuristic method for global optimization ⋮ Sums of squares based approximation algorithms for MAX-SAT ⋮ Barrier certificates revisited ⋮ Exact conic programming relaxations for a class of convex polynomial cone programs ⋮ Semidefinite approximations of conical hulls of measured sets ⋮ Optimal switching between cash-flow streams ⋮ Stability and performance verification of optimization-based controllers ⋮ Construction of parametric barrier functions for dynamical systems using interval analysis ⋮ A search-based procedure for nonlinear real arithmetic ⋮ Polynomial designs. I: Polynomial characterizations of common properties of a design ⋮ Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces ⋮ A polynomial optimization approach to constant rebalanced portfolio selection ⋮ MetiTarski: An automatic theorem prover for real-valued special functions ⋮ A revision of the proof of the Kepler conjecture ⋮ A convex polynomial that is not sos-convex ⋮ A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming ⋮ Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems ⋮ A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones ⋮ A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization ⋮ Local stability analysis using simulations and sum-of-squares programming ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ Smaller SDP for SOS decomposition ⋮ Numerical approaches for collaborative data processing ⋮ An algorithm for the global optimization of a class of continuous minimax problems ⋮ A semi-algebraic approach for asymptotic stability analysis ⋮ Computing differential invariants of hybrid systems as fixed points ⋮ Conditions for strong ellipticity and M-eigenvalues ⋮ Advances in computational Lyapunov analysis using sum-of-squares programming ⋮ Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares ⋮ A dynamic inequality generation scheme for polynomial programming
This page was built for publication: Semidefinite programming relaxations for semialgebraic problems
