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.
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique (Q2014679) (← links)
- Positive univariate trace polynomials (Q2019288) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems (Q2022328) (← links)
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes (Q2022606) (← links)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials (Q2028496) (← links)
- Tensor \(Z\)-eigenvalue complementarity problems (Q2028497) (← links)
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations (Q2029007) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Lower bounds for cubic optimization over the sphere (Q2031942) (← links)
- The truncated Hamburger moment problems with gaps in the index set (Q2032313) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization (Q2044964) (← links)
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
- The moment-SOS hierarchy and the Christoffel-Darboux kernel (Q2047179) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction (Q2052380) (← links)
- Safety of stochastic systems: an analytic and computational approach (Q2065176) (← links)
- Newton polytopes and relative entropy optimization (Q2067684) (← links)
- Optimization over trace polynomials (Q2068367) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- An efficient alternating minimization method for fourth degree polynomial optimization (Q2070363) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Exploiting sparsity in complex polynomial optimization (Q2073057) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
- A global optimization method for multiple response optimization problems (Q2097463) (← links)
- Dimension-free entanglement detection in multipartite Werner states (Q2099794) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- An SDP relaxation method for Perron pairs of a nonnegative tensor (Q2113709) (← links)
- Finding the global optimum of a class of quartic minimization problem (Q2114839) (← links)
- Heat transport bounds for a truncated model of Rayleigh-Bénard convection via polynomial optimization (Q2116300) (← links)
- A convex optimization approach to synthesizing state feedback data-driven controllers for switched linear systems (Q2116667) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Fair colorful \(k\)-center clustering (Q2118132) (← links)
- Convergence of Lasserre's hierarchy: the general case (Q2119755) (← links)
- Continuous-variable nonlocality and contextuality (Q2124212) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- On the tightness of semidefinite relaxations for rotation estimation (Q2127273) (← links)
- Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting) (Q2131203) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
