A class of second-order cone eigenvalue complementarity problems for higher-order tensors

DOI10.1007/S40305-016-0137-ZMaRDI QIDQ2014672zbMATH OpenOpenAlexFDO

Authors Jiao-Jiao Hou, Chen Ling, Hongjin He

Publication date 25 August 2017

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.06413

zbMATH Keywords

nonlinear programmingnumerical resultspolynomial optimizationsecond-order cone tensor eigenvalue complementarity problemvariational inequality

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Variational inequalities (49J40) Numerical mathematical programming methods (65K05) Numerical methods for variational inequalities and related problems (65K15) Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Abstract: In this paper, we consider the second-order cone tensor eigenvalue complementarity problem (SOCTEiCP) and present three different reformulations to the model under consideration. Specifically, for the general SOCTEiCP, we first show its equivalence to a particular variational inequality under reasonable conditions. A notable benefit is that such a reformulation possibly provides an efficient way for the study of properties of the problem. Then, for the symmetric and sub-symmetric SOCTEiCPs, we reformulate them as appropriate nonlinear programming problems, which are extremely beneficial for designing reliable solvers to find solutions of the considered problem. Finally, we report some preliminary numerical results to verify our theoretical results.

Review text

The authors consider the second-order cone tensor eigenvalue complementarity problem (SOCTEiCP) and present three different reformulations of the model under consideration. For the general SOCTEiCP, they show its equivalence to a particular variational inequality under reasonable conditions. A notable benefit is that such a reformulation possibly provides an efficient way for the study of properties of the problem. For the symmetric and sub-symmetric SOCTEiCPs, they reformulate them as appropriate nonlinear programming problems, which are extremely beneficial for designing reliable solvers to find solutions of the considered problem. Some preliminary numerical results to verify our theoretical results are also provided.

Recommendations

• A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
• On the cone eigenvalue complementarity problem for higher-order tensors
• Higher-degree tensor eigenvalue complementarity problems
• Higher-degree eigenvalue complementarity problems for tensors
• The second-order cone eigenvalue complementarity problem

Cites work

• A new method for solving Pareto eigenvalue complementarity problems
• A new method for solving second-order cone eigenvalue complementarity problems
• A nonsmooth algorithm for cone-constrained eigenvalue problems
• A semismooth Newton method for tensor eigenvalue complementarity problem
• Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
• Cone-constrained eigenvalue problems: Theory and algorithms
• Eigenvalues of a real supersymmetric tensor
• Engineering and Economic Applications of Complementarity Problems
• Finding the largest eigenvalue of a nonnegative tensor
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
• Further results for Perron-Frobenius theorem for nonnegative tensors
• Generalized eigenvalue complementarity problem for tensors
• Higher order positive semidefinite diffusion tensor imaging
• scientific article; zbMATH DE number 1069173 (Why is no real title available?)
• Nonlinear Programming
• On eigenvalue problems of real symmetric 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
• Perron-Frobenius theorem for nonnegative tensors
• Second-order cone programming
• Smoothing functions for second-order-cone complementarity problems
• Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
• Tensor complementarity problem and semi-positive tensors
• Tensor eigenvalue complementarity problems
• The eigenvalue complementarity problem
• The second-order cone eigenvalue complementarity problem
• The sparsest solutions to \(Z\)-tensor complementarity problems
• The symmetric eigenvalue complementarity problem
• Z-eigenvalue methods for a global polynomial optimization problem

Cited in

(6)

• A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
• Tensor complementarity problems. I: Basic theory
• Convex analysis of the eigenvalues of a 3D second-order symmetric tensor
• Higher-degree eigenvalue complementarity problems for tensors
• The second-order cone eigenvalue complementarity problem
• On the cone eigenvalue complementarity problem for higher-order tensors

This page was built for publication: A class of second-order cone eigenvalue complementarity problems for higher-order tensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014672)