Pages that link to "Item:Q2434992"
From MaRDI portal
The following pages link to Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992):
Displayed 50 items.
- Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636) (← links)
- The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization (Q517310) (← 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)
- Tensor eigenvalue complementarity problems (Q1659680) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming (Q1994127) (← links)
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems (Q2022328) (← links)
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials (Q2028496) (← links)
- Tensor \(Z\)-eigenvalue complementarity problems (Q2028497) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- A global optimization method for multiple response optimization problems (Q2097463) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- An SDP relaxation method for Perron pairs of a nonnegative tensor (Q2113709) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- Hermitian completely positive matrices (Q2197205) (← links)
- Completely positive tensors in the complex field (Q2197844) (← 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)
- Tensor complementarity problems. II: Solution methods (Q2275317) (← links)
- A semidefinite relaxation method for second-order cone polynomial complementarity problems (Q2307702) (← links)
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706) (← links)
- Higher-degree tensor eigenvalue complementarity problems (Q2307709) (← links)
- Saddle points of rational functions (Q2307710) (← links)
- Test of copositive tensors (Q2313772) (← links)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- Minimizing trigonometric matrix polynomials over semi-algebraic sets (Q2342782) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints (Q2673375) (← links)
- Quadratic tensor eigenvalue complementarity problems (Q2691299) (← links)
- Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
- Positive Maps and Separable Matrices (Q2810548) (← links)
- GpoSolver: a Matlab/C++ toolbox for global polynomial optimization (Q2815514) (← links)
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) (← links)
- Stochastic polynomial optimization (Q5210742) (← links)
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization (Q5233101) (← links)
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472) (← links)
- Generic Properties for Semialgebraic Programs (Q5363376) (← links)
- A semidefinite method for tensor complementarity problems (Q5379459) (← links)
- Well-Posedness in Unconstrained Polynomial Optimization Problems (Q5741069) (← links)