Pages that link to "Item:Q2174498"
From MaRDI portal
The following pages link to A factorization method for completely positive matrices (Q2174498):
Displayed 13 items.
- A simplex algorithm for rational cp-factorization (Q2020599) (← links)
- A note on completely positive relaxations of quadratic problems in a multiobjective framework (Q2114601) (← links)
- Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression (Q2174096) (← links)
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection (Q2200085) (← links)
- Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- (Q5153530) (← links)
- Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
- Bures–Wasserstein Minimizing Geodesics between Covariance Matrices of Different Ranks (Q6053420) (← links)
- Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
- Exact convergence rates of alternating projections for nontransversal intersections (Q6179912) (← links)
- The cone of \(5 \times 5\) completely positive matrices (Q6191441) (← links)