A potential reduction method for tensor complementarity problems
From MaRDI portal
Publication:2313741
Recommendations
- Weakening convergence conditions of a potential reduction method for tensor complementarity problems
- An alternating direction method of multipliers for tensor complementarity problems
- Solvability of monotone tensor complementarity problems
- A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications
- Linearized methods for tensor complementarity problems
Cites work
- A Centered Projective Algorithm for Linear Programming
- A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
- A practical method for computing the largest M-eigenvalue of a fourth-order partially symmetric tensor
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An H-tensor based iterative scheme for identifying the positive definiteness of multivariate homogeneous forms
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- An Infeasible-Interior-Point Method for Linear Complementarity Problems
- An interior point potential reduction method for constrained equations
- An iterative method for finding the least solution to the tensor complementarity problem
- Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
- Column sufficient tensors and tensor complementarity problems
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
- Copositive tensor detection and its applications in physics and hypergraphs
- Copositivity detection of tensors: theory and algorithm
- Criteria for strong H-tensors
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues of a real supersymmetric tensor
- Exceptionally regular tensors and tensor complementarity problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Global convergence in infeasible-interior-point algorithms
- Global uniqueness and solvability for tensor complementarity problems
- Higher order positive semidefinite diffusion tensor imaging
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 4072729 (Why is no real title available?)
- Nonsingular \(H\)-tensor and its criteria
- On computing minimal \(H\)-eigenvalue of sign-structured tensors
- Positive-definite tensors to nonlinear complementarity problems
- Properties of solution set of tensor complementarity problem
- Properties of some classes of structured tensors
- Strictly semi-positive tensors and the boundedness of tensor complementarity problems
- Tensor algorithms of blind separation of electromagnetic signals
- Tensor Decompositions and Applications
- The Linear Complementarity Problem
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(30)- An SDP method for copositivity of partially symmetric tensors
- 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
- New lower bounds for the minimum M-eigenvalue of elasticity M-tensors and applications
- 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
- 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
- A fixed point iterative method for tensor complementarity problems
- Bounds of the solution set of the tensor complementarity problem
- Tensor complementarity problems. II: Solution methods
- On copositiveness identification of partially symmetric rectangular tensors
- Solvability of two classes of tensor complementarity problems
- Linearized methods for tensor complementarity problems
- Estimations on upper and lower bounds of solutions to a class of tensor complementarity problems
- Solving tensor complementarity problems with Z-tensors via a weighted fixed point method
- Further results on sum-of-squares tensors
- Generalized tensor complementarity problems over a polyhedral cone
- Stability of solutions and continuity of solution maps of tensor complementarity problems
- 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 projected splitting method for vertical tensor complementarity problems
- A linearized method for solving tensor complementarity problems with implicit Z-tensors
- A modulus-based formulation for the vertical tensor complementarity problem
- A general preconditioner for a class of vertical tensor complementarity problems
- Univariate representations of solutions to generic polynomial complementarity problems
- A projected fixed point method for a class of vertical tensor complementarity problems
This page was built for publication: A potential reduction method for tensor complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2313741)
