Tensor complementarity problems. II: Solution methods

DOI10.1007/S10957-019-01568-XzbMath1429.90082OpenAlexW2968579382MaRDI QIDQ2275317

Liqun Qi, Zheng-Hai Huang

Publication date: 2 October 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-019-01568-x

zbMATH Keywords

mixed integer programmingtensor complementarity problemsystem of tensor equationssemidefinite relaxation methodsystem of non-smooth equations

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (50)

Neural network approaches based on new NCP-functions for solving tensor complementarity problem ⋮ A new smoothing spectral conjugate gradient method for solving tensor complementarity problems ⋮ A smoothing projected HS method for solving stochastic tensor complementarity problem ⋮ Solution set bounds for LCPs over tensor spaces ⋮ Improved fixed point iterative methods for tensor complementarity problem ⋮ Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities ⋮ Mixed polynomial variational inequalities ⋮ Existence and uniqueness of solutions of the generalized polynomial variational inequality ⋮ Generalized multilinear games and vertical tensor complementarity problems ⋮ A fixed point iterative method for tensor complementarity problems with the implicit \(Z\)-tensors ⋮ Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem ⋮ Solvability of monotone tensor complementarity problems ⋮ A general preconditioner for tensor complementarity problems ⋮ A fixed point iterative method for tensor complementarity problems ⋮ New error bounds for the tensor complementarity problem ⋮ Unnamed Item ⋮ Bounds of the solution set of the tensor complementarity problem ⋮ Tensor complementarity problems with finite solution sets ⋮ Generalized Tensor Complementarity Problems Over a Polyhedral Cone ⋮ Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems ⋮ An alternating direction method of multipliers for tensor complementarity problems ⋮ Expected residual minimization method for monotone stochastic tensor complementarity problem ⋮ A projected splitting method for vertical tensor complementarity problems ⋮ Acceptable solutions and backward errors for tensor complementarity problems ⋮ Tensor complementarity problems. III: Applications ⋮ A lower dimensional linear equation approach to the m-tensor complementarity problem ⋮ A linearized method for solving tensor complementarity problems with implicit \(Z\)-tensors ⋮ A copositivity-type existence result for weakly homogeneous variational inequalities ⋮ A generalized alternating direction method of multipliers for tensor complementarity problems ⋮ Existence results of solutions to a generalized vertical polynomial complementarity problem in terms of vertical block tensor tuples ⋮ Bi-block positive semidefiniteness of bi-block symmetric tensors ⋮ Projected fixed-point method for vertical tensor complementarity problems ⋮ A Note on the Nonemptiness and Compactness of Solution Sets of Weakly Homogeneous Variational Inequalities ⋮ Pseudospectra localization sets of tensors with applications ⋮ Bounds of the solution set to the polynomial complementarity problem ⋮ Nonemptiness and compactness of solution sets to weakly homogeneous generalized variational inequalities ⋮ CVaR stochastic programming model for monotone stochastic tensor complementarity problem by using its penalized sample average approximation algorithm ⋮ Notes on the optimization problems corresponding to polynomial complementarity problems ⋮ Linearized methods for tensor complementarity problems ⋮ A semidefinite relaxation method for second-order cone polynomial complementarity problems ⋮ Stochastic structured tensors to stochastic complementarity problems ⋮ SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection ⋮ The existence and uniqueness of solution for tensor complementarity problem and related systems ⋮ Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems ⋮ A smoothing Newton method with a mixed line search for monotone weighted 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 smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings ⋮ Generalized polynomial complementarity problems over a polyhedral cone ⋮ Stochastic tensor complementarity problem with discrete distribution

Uses Software

• TenEig

Cites Work

• Unnamed Item
• Unnamed Item
• Positive-definite tensors to nonlinear complementarity problems
• The sparsest solutions to \(Z\)-tensor complementarity problems
• Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
• Smoothing algorithms for complementarity problems over symmetric cones
• Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• A new continuation method for complementarity problems with uniform P- functions
• On NCP-functions
• Global convergence in infeasible-interior-point algorithms
• Potential-reduction methods in mathematical programming
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• The tensor splitting with application to solve multi-linear systems
• An iterative method for finding the least solution to the tensor complementarity problem
• Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems
• A continuation method for tensor complementarity problems
• Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
• A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
• An interior point potential reduction method for constrained equations
• Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
• Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem
• Existence and uniqueness of positive solution for \(\mathcal{H}^+\)-tensor equations
• Tensor complementarity problems. I: Basic theory
• An equivalent tensor equation to the tensor complementarity problem with positive semi-definite \(Z\)-tensor
• A potential reduction method for tensor complementarity problems
• An inexact augmented Lagrangian multiplier method for solving quadratic complementary problems: an adapted algorithmic framework combining specific resolution techniques
• The hierarchy of local minimums in polynomial optimization
• The modulus-based nonsmooth Newton's method for solving linear complementarity problems
• Solving sparse non-negative tensor equations: algorithms and applications
• A nonsmooth version of Newton's method
• Solving multi-linear systems with \(\mathcal {M}\)-tensors
• A homotopy method for solving multilinear systems with M-tensors
• A mixed integer programming approach to the tensor complementarity problem
• Certifying convergence of Lasserre's hierarchy via flat truncation
• Global Optimization with Polynomials and the Problem of Moments
• On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems
• Computing Tensor Eigenvalues via Homotopy Methods
• Modulus-based matrix splitting iteration methods for linear complementarity problems
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• A Centered Projective Algorithm for Linear Programming
• Optimization and nonsmooth analysis
• Global Optimization Approach to the Linear Complementarity Problem
• Linear complementarity problems solvable by integer programming
• A simple proof of the Rademacher theorem
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• A General Framework of Continuation Methods for Complementarity Problems
• A special newton-type optimization method
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• Tensor complementarity problems: the GUS-property and an algorithm
• Splitting methods for tensor equations
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Modified gradient dynamic approach to the tensor complementarity problem
• A fast algorithm for solving circulant tensor systems
• A semidefinite method for tensor complementarity problems
• A new homotopy method for solving non-linear complementarity problems

This page was built for publication: Tensor complementarity problems. II: Solution methods