An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems

Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Multilinear algebra, tensor calculus (15A69)

Cites Work

Unnamed Item
Positive-definite tensors to nonlinear complementarity problems
Global uniqueness and solvability for tensor complementarity problems
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems
Minimal zero norm solutions of linear complementarity problems
The sparsest solutions to \(Z\)-tensor complementarity problems
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
Perron-Frobenius theorem for nonnegative tensors
Non-parametric analysis of a generalized regression model. The maximum rank correlation estimator
On a class of semi-positive tensors in tensor complementarity problem
\(\mathrm{P}\)-tensors, \(\mathrm{P}_0\)-tensors, and their applications
An iterative method for finding the least solution to the tensor complementarity problem
Positive definite and Gram tensor complementarity problems
Support-vector networks
Regularization networks and support vector machines
Stochastic tensor complementarity problem with discrete distribution
The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
A shrinkage-thresholding projection method for sparsest solutions of LCPs
Extragradient thresholding methods for sparse solutions of co-coercive ncps
Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem
Properties of some classes of structured tensors
Solving sparse non-negative tensor equations: algorithms and applications
Solving multi-linear systems with \(\mathcal {M}\)-tensors
Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
Support Vector Machines with the Ramp Loss and the Hard Margin Loss
Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems
Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
Equivalence of the Complementarity Problem to a System of Nonlinear Equations
A special newton-type optimization method
Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory
Finite-Dimensional Variational Inequalities and Complementarity Problems
On the properties of tensor complementarity problems
Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
Preconditioned tensor splitting AOR iterative methods for ℋ‐tensor equations
Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
The Elements of Statistical Learning

This page was built for publication: An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems