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.
- Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems (Q2144545) (← links)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (Q2144547) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- On the complexity of Putinar-Vasilescu's Positivstellensatz (Q2145082) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← links)
- Semidefinite programming hierarchies for constrained bilinear optimization (Q2149569) (← links)
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices (Q2158273) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- Frameworks and results in distributionally robust optimization (Q2165596) (← links)
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (Q2176277) (← links)
- One-shot set-membership identification of generalized Hammerstein-Wiener systems (Q2188270) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- The geometry of SDP-exactness in quadratic optimization (Q2191775) (← links)
- Robust and optimal registration of image sets and structured scenes via sum-of-squares polynomials (Q2193802) (← links)
- Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Completely positive tensors in the complex field (Q2197844) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Computing nearby non-trivial Smith forms (Q2200314) (← links)
- Induced \(\mathcal{L}_2\)-gain computation for rational LPV systems using Finsler's lemma and minimal generators (Q2203463) (← links)
- Cooperativity, absolute interaction, and algebraic optimization (Q2204875) (← links)
- On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
- Sparse linear regression from perturbed data (Q2208606) (← links)
- A computational approach to non-smooth optimization by diffusion equations (Q2222070) (← links)
- Reconstruction of convex bodies from moments (Q2223625) (← links)
- A note on convex relaxations for the inverse eigenvalue problem (Q2230796) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- Exploiting term sparsity in noncommutative polynomial optimization (Q2231045) (← links)
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation (Q2231643) (← links)
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory (Q2235150) (← links)
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian (Q2235162) (← links)
- Leveraged least trimmed absolute deviations (Q2241912) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
- Polynomial optimization on some unbounded closed semi-algebraic sets (Q2275290) (← links)
- Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
- A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks (Q2280910) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
- Regularized nonlinear acceleration (Q2288185) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (Q2297658) (← links)
- A new updating method for the damped mass-spring systems (Q2306758) (← links)
- A semidefinite relaxation method for second-order cone polynomial complementarity problems (Q2307702) (← links)
