Pages that link to "Item:Q745685"
From MaRDI portal
The following pages link to Linear optimization with cones of moments and nonnegative polynomials (Q745685):
Displaying 37 items.
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Tensor eigenvalue complementarity problems (Q1659680) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials (Q2028496) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions (Q2135086) (← links)
- Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems (Q2144545) (← 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 hierarchy of semidefinite relaxations for completely positive tensor optimization problems (Q2274887) (← links)
- Higher-degree tensor eigenvalue complementarity problems (Q2307709) (← 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)
- Quadratic tensor eigenvalue complementarity problems (Q2691299) (← links)
- Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
- The CP-Matrix Approximation Problem (Q2790067) (← links)
- Positive Maps and Separable Matrices (Q2810548) (← links)
- Completely Positive Binary Tensors (Q5108231) (← links)
- Hermitian Tensor Decompositions (Q5146612) (← links)
- Stochastic polynomial optimization (Q5210742) (← links)
- Symmetric Tensor Nuclear Norms (Q5369251) (← links)
- Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692) (← links)
- The maximum tensor complementarity eigenvalues (Q5859001) (← links)
- Separability of Hermitian tensors and PSD decompositions (Q5888855) (← links)
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
- Dehomogenization for completely positive tensors (Q6107957) (← links)
- Rational Generalized Nash Equilibrium Problems (Q6116245) (← links)
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization (Q6136658) (← links)
- A utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
- Generalized truncated moment problems with unbounded sets (Q6159298) (← links)
- The multivariate eigenvalues of symmetric tensors (Q6641760) (← links)
- Robust approximation of chance constrained optimization with polynomial perturbation (Q6642796) (← links)
