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.
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization (Q989898) (← links)
- A semidefinite programming approach to the generalized problem of moments (Q995783) (← links)
- Cyclic convex bodies and optimization moment problems (Q996313) (← links)
- Positive polynomials on projective limits of real algebraic varieties (Q998968) (← links)
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- A Striktpositivstellensatz for measurable functions (Q1012389) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← links)
- A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
- Third-order extensions of Lo's semiparametric bound for European call options (Q1026788) (← links)
- Numerical approaches for collaborative data processing (Q1027146) (← links)
- An algorithm for the global optimization of a class of continuous minimax problems (Q1028590) (← links)
- Semidefinite characterization and computation of zero-dimensional real radical ideals (Q1029543) (← links)
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares (Q1030710) (← links)
- A generalized flat extension theorem for moment matrices (Q1039946) (← links)
- Conditions for strong ellipticity and M-eigenvalues (Q1042549) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Modified \(r\)-algorithm to find the global minimum of polynomial functions (Q1280905) (← links)
- Global optimization of nonconvex polynomial programming problems having rational exponents (Q1387651) (← links)
- Global minimization of a multivariate polynomial using matrix methods (Q1402540) (← links)
- The method of moments in global optimization (Q1417352) (← links)
- Polynomial optimization problem. (Q1594078) (← links)
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches (Q1616947) (← links)
- Sum-of-squares rank upper bounds for matching problems (Q1631641) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Global uniqueness and solvability of tensor variational inequalities (Q1637354) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Set-membership errors-in-variables identification of MIMO linear systems (Q1640709) (← links)
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity (Q1646680) (← links)
- On calculation of norms of 2D-systems (Q1647286) (← links)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← 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)
- Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
- On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
- Global optimization for optimal power flow over transmission networks (Q1683333) (← links)
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Convexification of generalized network flow problem (Q1717233) (← links)
- Optimal control of switching topology networks (Q1718012) (← links)
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method (Q1730769) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Multipolar robust optimization (Q1731824) (← links)
