The following pages link to (Q3601990):
Displaying 50 items.
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials (Q847674) (← links)
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints (Q868470) (← links)
- The subnormal completion problem in several variables (Q891416) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Real root finding for determinants of linear matrices (Q898255) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Many 2-level polytopes from matroids (Q908212) (← links)
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming (Q984697) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- A generalized flat extension theorem for moment matrices (Q1039946) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Positivity of Riesz functionals and solutions of quadratic and quartic moment problems (Q1048166) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Polynomial-exponential decomposition from moments (Q1620891) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem (Q1657401) (← links)
- Tensor eigenvalue complementarity problems (Q1659680) (← links)
- Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions (Q1704603) (← links)
- The multidimensional truncated moment problem: Carathéodory numbers (Q1706563) (← links)
- The multidimensional truncated moment problem: atoms, determinacy, and core variety (Q1709720) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
- Positive definiteness of paired symmetric tensors and elasticity tensors (Q1743944) (← links)
- The core variety of a multisequence in the truncated moment problem (Q1746265) (← links)
- The singular bivariate quartic tracial moment problem (Q1752976) (← links)
- Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- Compactness criteria for real algebraic sets and Newton polyhedra (Q1756670) (← links)
- Approximating the Pareto set of multiobjective linear programs via robust optimization (Q1758268) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Complex orthogonal polynomials and numerical quadrature via hyponormality (Q1791083) (← links)
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
- A semidefinite approach for truncated \(K\)-moment problems (Q1928277) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
- Numerical algebraic geometry and semidefinite programming (Q1979983) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- A note on nondegenerate matrix polynomials (Q1994064) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- The tracial moment problem on quadratic varieties (Q1998623) (← links)
- An SDP method for copositivity of partially symmetric tensors (Q2007119) (← links)
- On the exactness of Lasserre relaxations and pure states over real closed fields (Q2007851) (← links)
- An introduction to matrix convex sets and free spectrahedra (Q2008156) (← links)
