Pages that link to "Item:Q2936592"
From MaRDI portal
The following pages link to Semidefinite Relaxations for Best Rank-1 Tensor Approximations (Q2936592):
Displaying 50 items.
- On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors (Q311692) (← links)
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere (Q341317) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- Iterative algorithms for computing US- and U-eigenpairs of complex tensors (Q508028) (← links)
- A semidefinite algorithm for completely positive tensor decomposition (Q513715) (← links)
- A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems (Q827565) (← links)
- Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications (Q829560) (← links)
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors (Q1616037) (← links)
- Completely positive tensor recovery with minimal nuclear value (Q1639713) (← links)
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method (Q1730769) (← links)
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems (Q1736403) (← links)
- Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
- A hybrid second-order method for homogenous polynomial optimization over unit sphere (Q2014677) (← links)
- Lower bounds for cubic optimization over the sphere (Q2031942) (← links)
- Computing tensor Z-eigenvalues via shifted inverse power method (Q2043206) (← links)
- Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor (Q2052265) (← links)
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
- An efficient alternating minimization method for fourth degree polynomial optimization (Q2070363) (← links)
- Riemannian Newton optimization methods for the symmetric tensor approximation problem (Q2070849) (← links)
- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors (Q2085661) (← links)
- Computing the largest C-eigenvalue of a tensor using convex relaxation (Q2115256) (← links)
- On the local stability of semidefinite relaxations (Q2144546) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- On approximation algorithm for orthogonal low-rank tensor approximation (Q2159448) (← links)
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors (Q2162522) (← links)
- On norm compression inequalities for partitioned block tensors (Q2174201) (← links)
- Completely positive tensors in the complex field (Q2197844) (← links)
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming (Q2220656) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- On decompositions and approximations of conjugate partial-symmetric tensors (Q2240646) (← links)
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems (Q2274887) (← links)
- How entangled can a multi-party system possibly be? (Q2285166) (← links)
- A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors (Q2302750) (← links)
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement (Q2307708) (← links)
- A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors (Q2307757) (← links)
- Homotopy techniques for tensor decomposition and perfect identifiability (Q2317007) (← links)
- Pseudospectra localizations for generalized tensor eigenvalues to seek more positive definite tensors (Q2327430) (← links)
- Numerical optimization for symmetric tensor decomposition (Q2349123) (← links)
- An adaptive gradient method for computing generalized tensor eigenpairs (Q2374369) (← links)
- Spherical optimization with complex variables for computing US-eigenpairs (Q2374370) (← links)
- Computing extreme eigenvalues of large scale Hankel tensors (Q2399200) (← links)
- A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors (Q2420148) (← links)
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions (Q2631991) (← links)
- The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors (Q2693786) (← links)
- Computing Tensor Eigenvalues via Homotopy Methods (Q2797103) (← links)
- Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations (Q2797107) (← links)
- Low-Rank Approximation and Completion of Positive Tensors (Q2827064) (← links)
- Multilinear PageRank (Q3456870) (← links)
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors (Q3456878) (← links)
