Stochastic tensor complementarity problem with discrete distribution
From MaRDI portal
Publication:2116609
Recommendations
- Stochastic structured tensors to stochastic complementarity problems
- A smoothing projected HS method for solving stochastic tensor complementarity problem
- Stochastic \(R_0\) tensors to stochastic tensor complementarity problems
- Expected residual minimization method for monotone stochastic tensor complementarity problem
- A semismooth projected Newton method for solving stochastic linear complementarity problems
Cites work
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 7313891 (Why is no real title available?)
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- A continuation method for tensor complementarity problems
- A lower dimensional linear equation approach to the m-tensor complementarity problem
- A mixed integer programming approach to the tensor complementarity problem
- A nonsmooth version of Newton's method
- A penalized Fischer-Burmeister NCP-function
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- A special newton-type optimization method
- Acceptable solutions and backward errors for tensor complementarity problems
- An iterative method for finding the least solution to the tensor complementarity problem
- Bounds of the solution set of the tensor complementarity problem
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Eigenvalues of a real supersymmetric tensor
- Exceptionally regular tensors and tensor complementarity problems
- Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
- Expected residual minimization method for monotone stochastic tensor complementarity problem
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Global uniqueness and solvability for tensor complementarity problems
- Modified gradient dynamic approach to the tensor complementarity problem
- Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Optimization and nonsmooth analysis
- Positive-definite tensors to nonlinear complementarity problems
- Properties of solution set of tensor complementarity problem
- Properties of some classes of structured tensors
- Robust solution of monotone stochastic linear complementarity problems
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Stochastic \(R_0\) tensors to stochastic tensor complementarity problems
- Stochastic structured tensors to stochastic complementarity problems
- Symmetric nonnegative tensors and copositive tensors
- Tensor absolute value equations
- Tensor complementarity problem and semi-positive tensors
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. II: Solution methods
- Tensor complementarity problems. III: Applications
- Tensor complementarity problems: the GUS-property and an algorithm
- Theory and Computation of Complex Tensors and its Applications
- Two-Point Step Size Gradient Methods
- \(\mathrm{P}\)-tensors, \(\mathrm{P}_0\)-tensors, and their applications
Cited in
(8)- An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems
- Stochastic \(R_0\) tensors to stochastic tensor complementarity problems
- Stochastic absolute value equations
- Randomized Kaczmarz methods for tensor complementarity problems
- New error bounds for the tensor complementarity problem
- A smoothing projected HS method for solving stochastic tensor complementarity problem
- CVaR stochastic programming model for monotone stochastic tensor complementarity problem by using its penalized sample average approximation algorithm
- Stochastic structured tensors to stochastic complementarity problems
This page was built for publication: Stochastic tensor complementarity problem with discrete distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116609)
