A smoothing projected HS method for solving stochastic tensor complementarity problem

DOI10.1007/s12190-023-01868-6zbMath1522.90052OpenAlexW4367670245MaRDI QIDQ6046866

Mengdie Lu, Shou-qiang Du

Publication date: 6 October 2023

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-023-01868-6

zbMATH Keywords

expected residual minimizationstochastic tensor complementarity problemrestricted nonlinear complementarity functionsmoothing projected HS method

Mathematics Subject Classification ID

Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Multilinear algebra, tensor calculus (15A69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of solution set of tensor complementarity problem
• Sample average approximation of stochastic dominance constrained programs
• CVaR-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems
• The sparsest solutions to \(Z\)-tensor complementarity problems
• Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
• Two modified HS type conjugate gradient methods for unconstrained optimization problems
• Accelerated projected gradient method for linear inverse problems with sparsity constraints
• Stochastic nonlinear complementarity problem and applications to traffic equilibrium under uncertainty
• Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
• Properties of restricted NCP functions for nonlinear complementarity problems
• Stationary points of bound constrained minimization reformulations of complementarity problems
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• A penalized Fischer-Burmeister NCP-function
• An iterative method for finding the least solution to the tensor complementarity problem
• A continuation method for tensor complementarity problems
• The sample average approximation method applied to stochastic routing problems: a computational study
• A projected gradient method for vector optimization problems
• Expected residual minimization method for monotone stochastic tensor complementarity problem
• Stochastic tensor complementarity problem with discrete distribution
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem
• Tensor complementarity problems. I: Basic theory
• Tensor complementarity problems. II: Solution methods
• Tensor complementarity problems. III: Applications
• Stochastic structured tensors to stochastic complementarity problems
• A modified spectral conjugate gradient method with global convergence
• Properties of some classes of structured tensors
• Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
• Stochastic \(R_0\) tensors to stochastic tensor complementarity problems
• A mixed integer programming approach to the tensor complementarity problem
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Combined Monte Carlo sampling and penalty method for Stochastic nonlinear complementarity problems
• Projected gradient methods for linearly constrained problems
• Smooth Approximations to Nonlinear Complementarity Problems
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
• New restricted NCP functions and their applications to stochastic NCP and stochastic MPEC
• New reformulations for stochastic nonlinear complementarity problems

This page was built for publication: A smoothing projected HS method for solving stochastic tensor complementarity problem