Tensor complementarity problems. II: Solution methods (Q2275317)

scientific article

Language	Label	Description	Also known as
English	Tensor complementarity problems. II: Solution methods	scientific article

Statements

instance of

scholarly article

0 references

title

Tensor complementarity problems. II: Solution methods (English)

0 references

0 references

0 references

Journal of Optimization Theory and Applications

0 references

publication date

2 October 2019

0 references

zbMATH Keywords

tensor complementarity problem

0 references

system of tensor equations

0 references

system of non-smooth equations

0 references

mixed integer programming

0 references

semidefinite relaxation method

0 references

describes a project that uses

TenEig

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10957-019-01568-x

0 references

cites work

Tensor complementarity problems. I: Basic theory

0 references

The sparsest solutions to \(Z\)-tensor complementarity problems

0 references

An equivalent tensor equation to the tensor complementarity problem with positive semi-definite \(Z\)-tensor

0 references

An iterative method for finding the least solution to the tensor complementarity problem

0 references

Q4382667

0 references

A continuation method for tensor complementarity problems

0 references

A potential reduction method for tensor complementarity problems

0 references

Formulating an \(n\)-person noncooperative game as a tensor complementarity problem

0 references

Tensor complementarity problems: the GUS-property and an algorithm

0 references

A mixed integer programming approach to the tensor complementarity problem

0 references

A semidefinite method for tensor complementarity problems

0 references

A simple proof of the Rademacher theorem

0 references

Optimization and nonsmooth analysis

0 references

Semismooth and Semiconvex Functions in Constrained Optimization

0 references

A nonsmooth version of Newton's method

0 references

Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations

0 references

Solving multi-linear systems with \(\mathcal {M}\)-tensors

0 references

Solving sparse non-negative tensor equations: algorithms and applications

0 references

A homotopy method for solving multilinear systems with M-tensors

0 references

A fast algorithm for solving circulant tensor systems

0 references

Tensor methods for solving symmetric \({\mathcal {M}}\)-tensor systems

0 references

Splitting methods for tensor equations

0 references

The tensor splitting with application to solve multi-linear systems

0 references

A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors

0 references

Existence and uniqueness of positive solution for \(\mathcal{H}^+\)-tensor equations

0 references

Potential-reduction methods in mathematical programming

0 references

Positive-definite tensors to nonlinear complementarity problems

0 references

Global convergence in infeasible-interior-point algorithms

0 references

A Centered Projective Algorithm for Linear Programming

0 references

An interior point potential reduction method for constrained equations

0 references

A potential reduction method for the generalized linear complementarity problem over a polyhedral cone

0 references

A new continuation method for complementarity problems with uniform P- functions

0 references

Homotopy Continuation Methods for Nonlinear Complementarity Problems

0 references

A General Framework of Continuation Methods for Complementarity Problems

0 references

A new homotopy method for solving non-linear complementarity problems

0 references

On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems

0 references

Computing Tensor Eigenvalues via Homotopy Methods

0 references

On NCP-functions

0 references

Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems

0 references

A Non-Interior-Point Continuation Method for Linear Complementarity Problems

0 references

Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities

0 references

A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities

0 references

A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem

0 references

Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function

0 references

Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP

0 references

Smoothing algorithms for complementarity problems over symmetric cones

0 references

A special newton-type optimization method

0 references

Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms

0 references

Modified gradient dynamic approach to the tensor complementarity problem

0 references

Q4039868

0 references

Modulus-based matrix splitting iteration methods for linear complementarity problems

0 references

The modulus-based nonsmooth Newton's method for solving linear complementarity problems

0 references

Linear complementarity problems solvable by integer programming

0 references

Global Optimization Approach to the Linear Complementarity Problem

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

Semidefinite characterization and computation of zero-dimensional real radical ideals

0 references

Certifying convergence of Lasserre's hierarchy via flat truncation

0 references

The hierarchy of local minimums in polynomial optimization

0 references

An inexact augmented Lagrangian multiplier method for solving quadratic complementary problems: an adapted algorithmic framework combining specific resolution techniques

0 references

Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem

0 references

Identifiers

zbMATH Open document ID

1429.90082

0 references

DOI

10.1007/s10957-019-01568-x

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2275317