The following pages link to (Q3395491):
Displaying 50 items.
- Minimizing the sum of many rational functions (Q266410) (← links)
- Amoebas, nonnegative polynomials and sums of squares supported on circuits (Q268411) (← links)
- Nonnegative Morse polynomial functions and polynomial optimization (Q291995) (← links)
- Moment closure approximations of the Boltzmann equation based on \(\varphi \)-divergences (Q315643) (← links)
- Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (Q321039) (← links)
- Operator Positivstellensätze for noncommutative polynomials positive on matrix convex sets (Q323781) (← links)
- Constructive proofs of some positivstellensätze for compact semialgebraic subsets of \(\mathbb R^{d }\) (Q368724) (← links)
- Borel measures with a density on a compact semi-algebraic set (Q382256) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- The convex Positivstellensatz in a free algebra (Q436182) (← links)
- Free semidefinite representation of matrix power functions (Q471947) (← links)
- Design of Marx generators as a structured eigenvalue assignment (Q472612) (← links)
- The cubic complex moment problem (Q484795) (← links)
- Lebesgue decomposition in action via semidefinite relaxations (Q503483) (← links)
- Convergence rates of moment-sum-of-squares hierarchies for optimal control problems (Q511733) (← links)
- On the extreme points of moments sets (Q530416) (← links)
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations (Q694844) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Sums of squares of polynomials with rational coefficients (Q726755) (← links)
- Mean squared error minimization for inverse moment problems (Q741143) (← links)
- Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control (Q781560) (← links)
- Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis (Q782924) (← links)
- Characterization of the moment space corresponding to the Levermore basis (Q784336) (← links)
- Synthesizing invariant barrier certificates via difference-of-convex programming (Q832194) (← links)
- Exact safety verification of hybrid systems using sums-of-squares representation (Q893625) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- Algebraic-exponential data recovery from moments (Q908214) (← links)
- Positive polynomials and semidefinite programming (Q948606) (← links)
- Book review of: M. Aschenbrenner et al., Asymptotic differential algebra and model theory of transseries (Q1621512) (← links)
- Set-membership errors-in-variables identification of MIMO linear systems (Q1640709) (← links)
- Tensor eigenvalue complementarity problems (Q1659680) (← links)
- Polynomials with bounds and numerical approximation (Q1681786) (← links)
- The role of non-negative polynomials for rank-one convexity and quasi convexity (Q1691828) (← links)
- On the truncated two-dimensional moment problem (Q1704298) (← links)
- Optimal bounds and extremal trajectories for time averages in nonlinear dynamical systems (Q1709156) (← links)
- Approximate optimal designs for multivariate polynomial regression (Q1731748) (← links)
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
- The core variety of a multisequence in the truncated moment problem (Q1746265) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets (Q1749771) (← links)
- Compactness criteria for real algebraic sets and Newton polyhedra (Q1756670) (← links)
- A MAX-CUT formulation of 0/1 programs (Q1785732) (← links)
- Complex orthogonal polynomials and numerical quadrature via hyponormality (Q1791083) (← links)
- Discussion on: ``A decomposition algorithm for KYP-SDPs'' (Q1937317) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- Dual optimal design and the Christoffel-Darboux polynomial (Q1996729) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability (Q2022366) (← links)
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes (Q2022606) (← links)
