Pages that link to "Item:Q486690"
From MaRDI portal
The following pages link to The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690):
Displayed 50 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)
- On cones of nonnegative quartic forms (Q525602) (← links)
- Monotonically positive matrices (Q745213) (← links)
- Partially positive matrices (Q892772) (← links)
- Interiors of completely positive cones (Q897047) (← links)
- Flat extension and ideal projection (Q1635276) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Tensor eigenvalue complementarity problems (Q1659680) (← links)
- Approximate optimal designs for multivariate polynomial regression (Q1731748) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- The core variety of a multisequence in the truncated moment problem (Q1746265) (← links)
- Tensor maximal correlation problems (Q1753137) (← links)
- A simplex algorithm for rational cp-factorization (Q2020599) (← links)
- The truncated Hamburger moment problems with gaps in the index set (Q2032313) (← links)
- The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions (Q2035576) (← links)
- Estimation of multivariate generalized gamma convolutions through Laguerre expansions (Q2074286) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- Bounding the separable rank via polynomial optimization (Q2144234) (← links)
- Sparse noncommutative polynomial optimization (Q2144551) (← links)
- The truncated moment problem on the union of parallel lines (Q2151569) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- A factorization method for completely positive matrices (Q2174498) (← 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)
- A semidefinite relaxation algorithm for checking completely positive separable matrices (Q2313773) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method (Q2329795) (← links)
- The strong truncated Hamburger moment problem with and without gaps (Q2674890) (← 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)
- Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- Completely Positive Binary Tensors (Q5108231) (← links)
- Hermitian Tensor Decompositions (Q5146612) (← links)
- Stochastic polynomial optimization (Q5210742) (← links)
- Symmetric Tensor Nuclear Norms (Q5369251) (← links)
- A unified framework of SAGE and SONC polynomials and its duality theory (Q5856744) (← links)
- The maximum tensor complementarity eigenvalues (Q5859001) (← links)
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition (Q5870360) (← links)
- Separability of Hermitian tensors and PSD decompositions (Q5888855) (← links)
- Constrained trace-optimization of polynomials in freely noncommuting variables (Q5964245) (← links)
- Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)