A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with P₀ mappings
From MaRDI portal
Publication:2097504
Recommendations
- A smoothing Newton method for tensor eigenvalue complementarity problems
- A smoothing Newton algorithm for tensor complementarity problem based on the modulus-based reformulation
- A smoothing Newton method for ncps with the \(P_{0}\)-property
- Solvability of monotone tensor complementarity problems
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
Cites work
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- A mixed integer programming approach to the tensor complementarity problem
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A note on the nonemptiness and compactness of solution sets of weakly homogeneous variational inequalities
- A regularization Newton method for solving nonlinear complementarity problems
- A semidefinite method for tensor complementarity problems
- A special newton-type optimization method
- Eigenvalues of a real supersymmetric tensor
- Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems
- Global uniqueness and solvability for tensor complementarity problems
- Global uniqueness and solvability of tensor variational inequalities
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- On \(Q\)-tensors
- Polynomial complementarity problems
- Positive-definite tensors to nonlinear complementarity problems
- Properties of solution set of tensor complementarity problem
- Properties of some classes of structured tensors
- Properties of tensor complementarity problem and some classes of structured tensors
- Smooth Approximations to Nonlinear Complementarity Problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Sub-quadratic convergence of a smoothing Newton algorithm for the P₀- and monotone LCP
- Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP without strict complementarity
- Tensor analysis. Spectral theory and special tensors
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. II: Solution methods
- Tensor complementarity problems. III: Applications
- Tensor eigenvalues and their applications
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
- Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones
- \(M\)-tensors and some applications
Cited in
(6)- An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems
- scientific article; zbMATH DE number 7338480 (Why is no real title available?)
- A new smoothing spectral conjugate gradient method for solving tensor complementarity problems
- scientific article; zbMATH DE number 7594719 (Why is no real title available?)
- Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities
- A smoothing Newton algorithm for tensor complementarity problem based on the modulus-based reformulation
This page was built for publication: A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097504)
