Sparse solutions to stochastic tensor complementarity problem
From MaRDI portal
Cites work
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- A shrinkage-thresholding projection method for sparsest solutions of LCPs
- A smoothing projected HS method for solving stochastic tensor complementarity problem
- Agnostic learning of monomials by halfspaces is hard
- An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems
- An iterative method for finding the least solution to the tensor complementarity problem
- Continuous-Domain Signal Reconstruction Using $L_{p}$-Norm Regularization
- CVaR stochastic programming model for monotone stochastic tensor complementarity problem by using its penalized sample average approximation algorithm
- Expected residual minimization method for monotone stochastic tensor complementarity problem
- Extragradient thresholding methods for sparse solutions of co-coercive ncps
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Generalized multilinear games and vertical tensor complementarity problems
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- Nonnegative image reconstruction from sparse Fourier data: a new deconvolution algorithm
- On NCP-functions
- On sparse solution of tensor complementarity problem
- On the difficulty of approximately maximizing agreements.
- Properties of some classes of structured tensors
- Properties of tensor complementarity problem and some classes of structured tensors
- Proximal mapping for symmetric penalty and sparsity
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- Robust solution of monotone stochastic linear complementarity problems
- Sample-path solution of stochastic variational inequalities
- Signal reconstruction by conjugate gradient algorithm based on smoothing l₁-norm
- Solvability of monotone tensor complementarity problems
- Some properties of the solution of the extended vertical tensor complementarity problem
- Sparse signal recovery from quadratic measurements via convex programming
- Sparse solutions of linear complementarity problems
- Stochastic R₀ tensors to stochastic tensor complementarity problems
- Stochastic structured tensors to stochastic complementarity problems
- Stochastic tensor complementarity problem with discrete distribution
- Tensor absolute value equations
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. II: Solution methods
- Tensor complementarity problems. III: Applications
- The Elements of Statistical Learning
- The existence and uniqueness of solution for tensor complementarity problem and related systems
- The generalized order tensor complementarity problems
- The GUS-property and modulus-based methods for tensor complementarity problems
- The horizontal tensor complementarity problem
- The sample average approximation method for stochastic discrete optimization
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Variational Analysis
This page was built for publication: Sparse solutions to stochastic tensor complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7396730)
