Pages that link to "Item:Q403636"
From MaRDI portal
The following pages link to Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636):
Displaying 50 items.
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- Stability and genericity for semi-algebraic compact programs (Q289119) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- Monotonically positive matrices (Q745213) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Partially positive matrices (Q892772) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Set-membership errors-in-variables identification of MIMO linear systems (Q1640709) (← links)
- Tensor eigenvalue complementarity problems (Q1659680) (← links)
- A multilevel analysis of the Lasserre hierarchy (Q1735163) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony? (Q2000529) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← 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)
- The moment-SOS hierarchy and the Christoffel-Darboux kernel (Q2047179) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- Convergence of Lasserre's hierarchy: the general case (Q2119755) (← links)
- Homogeneous polynomials and spurious local minima on the unit sphere (Q2128762) (← links)
- On the complexity of Putinar-Vasilescu's Positivstellensatz (Q2145082) (← links)
- Positivity certificates and polynomial optimization on non-compact semialgebraic sets (Q2149557) (← 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)
- One-shot set-membership identification of generalized Hammerstein-Wiener systems (Q2188270) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Completely positive tensors in the complex field (Q2197844) (← links)
- On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← 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)
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems (Q2274887) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
- Saddle points of rational functions (Q2307710) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
- Solving rank-constrained semidefinite programs in exact arithmetic (Q2409017) (← links)
