A smoothing projected HS method for solving stochastic tensor complementarity problem

DOI10.1007/S12190-023-01868-6MaRDI QIDQ6046866zbMATH OpenOpenAlexFDO

Authors Mengdie Lu, Shouqiang 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 minimizationrestricted nonlinear complementarity functionsmoothing projected HS methodstochastic tensor complementarity problem

Mathematics Subject Classification ID

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

Recommendations

• Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
• A new smoothing spectral conjugate gradient method for solving tensor complementarity problems
• A semismooth projected Newton method for solving stochastic linear complementarity problems
• Stochastic structured tensors to stochastic complementarity problems
• scientific article; zbMATH DE number 7594719
• Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
• Stochastic R₀ tensors to stochastic tensor complementarity problems
• A smoothing Newton method for tensor eigenvalue complementarity problems
• A Stochastic Smoothing Algorithm for Semidefinite Programming
• Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems

Cites work

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

Cited in

(4)

• Stochastic tensor complementarity problem with discrete distribution
• Stochastic structured tensors to stochastic complementarity problems
• Strict feasibility for the polynomial complementarity problem
• CVaR stochastic programming model for monotone stochastic tensor complementarity problem by using its penalized sample average approximation algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046866)