Pages that link to "Item:Q2706355"
From MaRDI portal
The following pages link to Global optimization with polynomials and the problem of moments (Q2706355):
Displaying 50 items.
- Dynamic modeling and analysis of the email virus propagation (Q714258) (← links)
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres (Q721466) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- Space tensor conic programming (Q742309) (← links)
- Monotonically positive matrices (Q745213) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares (Q816068) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Stability of quadratic modules (Q834811) (← links)
- Simulation of discrete linear time-invariant fuzzy dynamic systems (Q835082) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
- SDP relaxation of arbitrage pricing bounds based on option prices and moments (Q848736) (← links)
- Existence of global minima for constrained optimization (Q857595) (← links)
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals (Q863907) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- On the complexity of Putinar's Positivstellensatz (Q870344) (← links)
- On the complexity of Schmüdgen's Positivstellensatz (Q876820) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
- SOS approximations of nonnegative polynomials via simple high degree perturbations (Q883108) (← links)
- Integral quadratic constraints for delayed nonlinear and parameter-varying systems (Q888999) (← links)
- Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities (Q891237) (← links)
- Equality-constrained minimization of polynomial functions (Q892787) (← links)
- Extensions of Gauss quadrature via linear programming (Q896553) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Set-membership estimation of fiber laser physical parameters from input-output power measurements (Q900678) (← links)
- Low degree Nullstellensatz certificates for 3-colorability (Q907253) (← links)
- On global optimizations with polynomials (Q928299) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Stochastic 0-1 linear programming under limited distributional information (Q935201) (← links)
- Approximating integrals of multivariate exponentials: A moment approach (Q935225) (← links)
- Exact relaxations of non-convex variational problems (Q941046) (← links)
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
- Some applications of a polynomial inequality to global optimization (Q948639) (← links)
- The \(K\)-moment problem with densities (Q959945) (← links)
- An analogue of the Riesz-Haviland theorem for the truncated moment problem (Q960546) (← links)
- Coherent quantum LQG control (Q963775) (← links)
- Certificates of convexity for basic semi-algebraic sets (Q979173) (← 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)
