Photo from academic.microsoft.com
ABSTRACT This paper proposes an algorithm for computing the maximum (or minimum) complementarity eigenvalues of tensors. We formulate this as proper polynomial optimization problems that can be efficiently solved by… Click to show full abstract
ABSTRACT This paper proposes an algorithm for computing the maximum (or minimum) complementarity eigenvalues of tensors. We formulate this as proper polynomial optimization problems that can be efficiently solved by Lasserre type semidefinite relaxations. The algorithm is proved to have finite convergence for generic tensors.
Keywords:
complementarity;
complementarity eigenvalues;
maximum tensor;
tensor complementarity
Journal Title: Optimization Methods and Software
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Optimization Methods and Software
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!