A potential reduction method for tensor complementarity problems
From MaRDI portal
Publication:2313741
DOI10.3934/jimo.2018049zbMath1438.90370OpenAlexW2800721941WikidataQ129719655 ScholiaQ129719655MaRDI QIDQ2313741
Kaili Zhang, Pengfei Zhao, Hai-Bin Chen
Publication date: 23 July 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018049
positive definitenessinterior point methoddiagonalizablepotential reduction algorithmtensor complementary problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Positive matrices and their generalizations; cones of matrices (15B48) Multilinear algebra, tensor calculus (15A69)
Related Items
Further results on sum-of-squares tensors ⋮ A new smoothing spectral conjugate gradient method for solving tensor complementarity problems ⋮ High-order sum-of-squares structured tensors: theory and applications ⋮ A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem ⋮ Improved fixed point iterative methods for tensor complementarity problem ⋮ A fixed point iterative method for tensor complementarity problems with the implicit \(Z\)-tensors ⋮ A general preconditioner for tensor complementarity problems ⋮ A fixed point iterative method for tensor complementarity problems ⋮ Solving tensor complementarity problems with \(Z\)-tensors via a weighted fixed point method ⋮ Stability of Solutions and Continuity of Solution Maps of Tensor Complementarity Problems ⋮ Bounds of the solution set of the tensor complementarity problem ⋮ Generalized Tensor Complementarity Problems Over a Polyhedral Cone ⋮ An SDP method for copositivity of partially symmetric tensors ⋮ Tensor complementarity problems. II: Solution methods ⋮ An index detecting algorithm for a class of TCP \((\mathcal{A},q)\) equipped with nonsingular \(\mathcal{M}\)-tensors ⋮ A lower dimensional linear equation approach to the m-tensor complementarity problem ⋮ On copositiveness identification of partially symmetric rectangular tensors ⋮ Solvability of two classes of tensor complementarity problems ⋮ Linearized methods for tensor complementarity problems ⋮ New lower bounds for the minimum M-eigenvalue of elasticity M-tensors and applications ⋮ Estimations on upper and lower bounds of solutions to a class of tensor complementarity problems ⋮ Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems ⋮ Weakening convergence conditions of a potential reduction method for tensor complementarity problems ⋮ The GUS-property and modulus-based methods for tensor complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Positive-definite tensors to nonlinear complementarity problems
- An \(H\)-tensor based iterative scheme for identifying the positive definiteness of multivariate homogeneous forms
- Global uniqueness and solvability for tensor complementarity problems
- Properties of solution set of tensor complementarity problem
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Criteria for strong \(H\)-tensors
- Copositive tensor detection and its applications in physics and hypergraphs
- On computing minimal \(H\)-eigenvalue of sign-structured tensors
- Column sufficient tensors and tensor complementarity problems
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- D-eigenvalues of diffusion kurtosis tensors
- Z-eigenvalue methods for a global polynomial optimization problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Global convergence in infeasible-interior-point algorithms
- Copositivity detection of tensors: theory and algorithm
- Strictly semi-positive tensors and the boundedness of tensor complementarity problems
- An iterative method for finding the least solution to the tensor complementarity problem
- An interior point potential reduction method for constrained equations
- Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
- A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
- Properties of some classes of structured tensors
- Nonsingular \(H\)-tensor and its criteria
- Eigenvalues of a real supersymmetric tensor
- Exceptionally regular tensors and tensor complementarity problems
- A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
- A Centered Projective Algorithm for Linear Programming
- The Linear Complementarity Problem
- Tensor algorithms of blind separation of electromagnetic signals
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres
- Higher Order Positive Semidefinite Diffusion Tensor Imaging
