Tensor eigenvalue complementarity problems
From MaRDI portal
Publication:1659680
eigenvalue complementarityLasserre relaxationpolynomial optimizationsemidefinite programtensor eigenvalues
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical optimization and variational techniques (65K10) Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Abstract: This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial optimization. When one tensor is strictly copositive, the complementarity eigenvalues can be computed by solving polynomial optimization with normalization by strict copositivity. When no tensor is strictly copositive, we formulate the tensor eigenvalue complementarity problem equivalently as polynomial optimization by a randomization process. The complementarity eigenvalues can be computed sequentially. The formulated polynomial optimization can be solved by Lasserre's hierarchy of semidefinite relaxations. We show that it has finite convergence for general tensors. Numerical experiments are presented to show the efficiency of proposed methods.
Recommendations
Cites work
- A complementarity eigenproblem in the stability analysis of finite dimensional elastic systems with frictional contact.
- A new method for solving Pareto eigenvalue complementarity problems
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- A semidefinite approach for truncated \(K\)-moment problems
- A semismooth Newton method for tensor eigenvalue complementarity problem
- Algebraic degree of polynomial optimization
- All real eigenvalues of symmetric tensors
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Cone-constrained eigenvalue problems: Theory and algorithms
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Dynamic stability of finite dimensional linearly elastic systems with unilateral contact and Coulomb friction
- Eigenvalues of a real supersymmetric tensor
- Finding the largest eigenvalue of a nonnegative tensor
- Generalized tensor eigenvalue problems
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Higher order positive semidefinite diffusion tensor imaging
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- Linear optimization with cones of moments and nonnegative polynomials
- Moments, positive polynomials and their applications
- Numerical resolution of cone-constrained eigenvalue problems
- On determinants and eigenvalue theory of tensors
- On the asymmetric eigenvalue complementarity problem
- On the cone eigenvalue complementarity problem for higher-order tensors
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Polynomial optimization with real varieties
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Some properties on Pareto-eigenvalues of higher-order tensors
- Stability of finite-dimensional nonlinear elastic systems with unilateral contact and friction
- Sums of squares, moment matrices and optimization over polynomials
- The \(\mathcal A\)-truncated \(K\)-moment problem
- The eigenvalue complementarity problem
- The hierarchy of local minimums in polynomial optimization
- The symmetric eigenvalue complementarity problem
- Truncated \(K\)-moment problems in several variables
- Using Algebraic Geometry
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(59)- Error bounds for the solution sets of quadratic complementarity problems
- Copositivity detection of tensors: theory and algorithm
- Solution sets of quadratic complementarity problems
- An SDP method for copositivity of partially symmetric tensors
- A class of second-order cone eigenvalue complementarity problems for higher-order tensors
- A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- Tensor \(Z\)-eigenvalue complementarity problems
- Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems
- Pareto eigenvalue inclusion intervals for tensors
- Nondegeneracy of eigenvectors and singular vector tuples of tensors
- Pareto \(Z\)-eigenvalue inclusion theorems for tensor eigenvalue complementarity problems
- Complementary problems with polynomial data
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. II: Solution methods
- On copositiveness identification of partially symmetric rectangular tensors
- Notes on the optimization problems corresponding to polynomial complementarity problems
- A semidefinite relaxation method for second-order cone polynomial complementarity problems
- Higher-degree tensor eigenvalue complementarity problems
- Test of copositive tensors
- An inexact augmented Lagrangian multiplier method for solving quadratic complementary problems: an adapted algorithmic framework combining specific resolution techniques
- Solving tensor E-eigenvalue problem faster
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints
- Quadratic tensor eigenvalue complementarity problems
- Loss functions for finite sets
- Higher-degree eigenvalue complementarity problems for tensors
- Exceptionally regular tensors and tensor complementarity problems
- Some advances in tensor analysis and polynomial optimization
- Polynomial complementarity problems
- A smoothing Newton method for tensor eigenvalue complementarity problems
- A semismooth Newton method for tensor eigenvalue complementarity problem
- A class of tensor eigenvalue complementarity problem
- Eigenvectors of tensors and algorithms for Waring decomposition
- scientific article; zbMATH DE number 6129396 (Why is no real title available?)
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- Linear complementarity problem over tensor spaces
- A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications
- Generalized eigenvalue complementarity problem for tensors
- High-order copositive tensors and its applications
- scientific article; zbMATH DE number 7313891 (Why is no real title available?)
- scientific article; zbMATH DE number 7410752 (Why is no real title available?)
- A semidefinite method for tensor complementarity problems
- The maximum tensor complementarity eigenvalues
- On the cone eigenvalue complementarity problem for higher-order tensors
- Homogenization for polynomial optimization with unbounded sets
- Pareto H-eigenvalue inclusion intervals for tensor eigenvalue complementarity problems
- Dehomogenization for completely positive tensors
- Pareto eigenvalue inclusion theorems and copositive tensors
- The moment-SOS hierarchy: applications and related topics
- The multivariate eigenvalues of symmetric tensors
- Perturbation theory for generalized \(\mathrm{T}\)-eigenvalues of third-order tensors
- Global optimization for the portfolio selection model with high-order moments
- Criteria of a copositive tensor with application to check vacuum stability of a general scalar potential
- Pareto Z-eigenvalue inclusion intervals for tensors with applications
- Solving polynomial variational inequality problems via Lagrange multiplier expressions and moment-SOS relaxations
- Low rank tensor decompositions and approximations
- Column sufficient tensors and tensor complementarity problems
- Localization of complementarity eigenvalues
- A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems
This page was built for publication: Tensor eigenvalue complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1659680)