The following pages link to (Q3601990):
Displayed 50 items.
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares (Q258393) (← links)
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Minimizing the sum of many rational functions (Q266410) (← links)
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors (Q268358) (← links)
- Amoebas, nonnegative polynomials and sums of squares supported on circuits (Q268411) (← links)
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
- Some applications of polynomial optimization in operations research and real-time decision making (Q276318) (← links)
- On the construction of general cubature formula by flat extensions (Q281965) (← links)
- Concepts and techniques of optimization on the sphere (Q287654) (← links)
- Stability and genericity for semi-algebraic compact programs (Q289119) (← links)
- A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding (Q290854) (← links)
- Nonnegative Morse polynomial functions and polynomial optimization (Q291995) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets (Q323781) (← links)
- Global completability with applications to self-consistent quantum tomography (Q329581) (← links)
- Real ideal and the duality of semidefinite programming for polynomial optimization (Q351462) (← links)
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- Scaling relationship between the copositive cone and Parrilo's first level approximation (Q395830) (← links)
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- Computation of correlated equilibrium with global-optimal expected social welfare (Q415417) (← links)
- The convex Positivstellensatz in a free algebra (Q436182) (← links)
- Linear control of time-domain constrained systems (Q445871) (← links)
- The truncated moment problem via homogenization and flat extensions (Q452366) (← links)
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- A Frank-Wolfe type theorem for nondegenerate polynomial programs (Q463745) (← links)
- Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
- Separating inequalities for nonnegative polynomials that are not sums of squares (Q480684) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
- The cubic complex moment problem (Q484795) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals (Q492020) (← links)
- A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← links)
- An improved semidefinite programming hierarchy for testing entanglement (Q529619) (← links)
- Symmetric tensor decomposition (Q603116) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- A facial reduction algorithm for finding sparse SOS representations (Q613325) (← links)
- Closures of quadratic modules (Q636039) (← links)
- Semidefinite representation of convex hulls of rational varieties (Q637512) (← links)
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems (Q644908) (← links)
- On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
- Positive semidefinite diagonal minus tail forms are sums of squares (Q658336) (← links)
- Further results on Cauchy tensors and Hankel tensors (Q668898) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres (Q721466) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)