The following pages link to Zhening Li (Q384205):
Displaying 21 items.
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- On optimal low rank Tucker approximation for tensors: the case for an adjustable core size (Q496606) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints (Q607501) (← links)
- Approximation algorithms for optimization of real-valued general conjugate complex forms (Q683722) (← links)
- Approximation methods for complex polynomial optimization (Q742305) (← links)
- On norm compression inequalities for partitioned block tensors (Q2174201) (← links)
- On decompositions and approximations of conjugate partial-symmetric tensors (Q2240646) (← links)
- On the tensor spectral \(p\)-norm and its dual norm via partitions (Q2307701) (← links)
- Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations (Q2797107) (← links)
- Bounds on the Spectral Norm and the Nuclear Norm of a Tensor Based on Tensor Partitions (Q2827070) (← links)
- Maximum Block Improvement and Polynomial Optimization (Q2902871) (← links)
- (Q2923562) (← links)
- On Convergence of the Maximum Block Improvement Method (Q2954383) (← links)
- On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
- Moments Tensors, Hilbert's Identity, and <i>k</i>-wise Uncorrelated Random Variables (Q5244868) (← links)
- Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
- On Orthogonal Tensors and Best Rank-One Approximation Ratio (Q5373918) (← links)
- Approximation Methods for Polynomial Optimization (Q5390033) (← links)
- Inhomogeneous polynomial optimization over a convex set: An approximation approach (Q5496212) (← links)
- Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual (Q6176424) (← links)
