The following pages link to (Q4428719):
Displaying 50 items.
- Characteristic polynomials of symmetric matrices over the univariate polynomial ring (Q2012044) (← links)
- Robust consensus for linear multi-agent systems with mixed uncertainties (Q2018585) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- Complements of unbounded convex polyhedra as polynomial images of \({{\mathbb{R}}}^n\) (Q2316794) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- Certification of real inequalities: templates and sums of squares (Q2349133) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- A recursive algorithm of exactness verification of relaxations for robust SDPs (Q2390543) (← links)
- Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992) (← links)
- Computing all roots of the likelihood equations of seemingly unrelated regressions (Q2457331) (← links)
- An alternative approach for nonlinear optimal control problems based on the method of moments (Q2457954) (← links)
- There are significantly more nonnegative polynomials than sums of squares (Q2480563) (← links)
- Global minimization of rational functions and the nearest GCDs (Q2481368) (← links)
- Global optimization of rational functions: a semidefinite programming approach (Q2490324) (← links)
- Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
- Matrix sum-of-squares relaxations for robust semi-definite programs (Q2492689) (← links)
- Establishing stability and instability of matrix hypercubes (Q2504535) (← links)
- LMI relaxations in robust control (Q2512026) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
- Solving polynomial least squares problems via semidefinite programming relaxations (Q2655337) (← links)
- Two results on the size of spectrahedral descriptions (Q2792406) (← links)
- Semidefinite Representation of Convex Sets and Convex Hulls (Q2802520) (← links)
- LMI Representations of Convex Semialgebraic Sets and Determinantal Representations of Algebraic Hypersurfaces: Past, Present, and Future (Q2849473) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- How to refine polynomial functions (Q2902640) (← links)
- (Q2972692) (← links)
- Sum of squares basis pursuit with linear and second order cone programming (Q2979646) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities (Q3295879) (← links)
- Definite determinantal representations of multivariate polynomials (Q3303794) (← links)
- Estimation of parameters in a network reliability model with spatial dependence (Q3373744) (← links)
- On Flattenability of Graphs (Q3452282) (← links)
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization (Q3565467) (← links)
- Sums of squares over totally real fields are rational sums of squares (Q3617579) (← links)
- A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems (Q4600837) (← links)
- Efficient Spherical Designs with Good Geometric Properties (Q4611850) (← links)
- Polynomial, regular and Nash images of Euclidean spaces (Q4635362) (← links)
- (Q4822047) (← links)
- Convex Algebraic Geometry of Curvature Operators (Q4991379) (← links)
- Control analysis and design via randomised coordinate polynomial minimisation (Q5027405) (← links)
- Numerical method for solving polynomial minimax problem (Q5143909) (← links)
- Pebble Minimization of Polyregular Functions (Q5145674) (← links)
- Best Nonnegative Rank-One Approximations of Tensors (Q5203971) (← links)
- A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
- Stochastic polynomial optimization (Q5210742) (← links)
- Generic Properties for Semialgebraic Programs (Q5363376) (← links)
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization (Q5382573) (← links)
- Well-Posedness in Unconstrained Polynomial Optimization Problems (Q5741069) (← links)
