Pages that link to "Item:Q4376201"
From MaRDI portal
The following pages link to Engineering and Economic Applications of Complementarity Problems (Q4376201):
Displaying 50 items.
- Alternative theorems for nonlinear projection equations and applications to generalized complementarity problems. (Q5953909) (← links)
- Unified framework of extragradient-type methods for pseudomonotone variational inequalities. (Q5956973) (← links)
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems. (Q5958086) (← links)
- A non-modulus linear method for solving the linear complementarity problem (Q5962835) (← links)
- On the cone eigenvalue complementarity problem for higher-order tensors (Q5963313) (← links)
- On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem (Q5965390) (← links)
- Preface (Q5965504) (← links)
- Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems (Q6042721) (← links)
- Approximate variational inequalities and equilibria (Q6060552) (← links)
- A modified multivariate spectral gradient projection method for nonlinear complementarity problems (Q6082264) (← links)
- A new matrix splitting generalized iteration method for linear complementarity problems (Q6090289) (← links)
- A class of modulus-based matrix splitting methods for vertical linear complementarity problem (Q6094603) (← links)
- A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI (Q6099416) (← links)
- Inertial proximal and contraction methods for solving monotone variational inclusion and fixed point problems (Q6107347) (← links)
- An inertial projection and contraction method for solving bilevel quasimonotone variational inequality problems (Q6118988) (← links)
- Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems (Q6126066) (← links)
- Improved modulus-based matrix splitting iteration methods for quasi-complementarity problems (Q6137797) (← links)
- Some more subclasses of \(Q\)-matrix (Q6161294) (← links)
- A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems (Q6166658) (← links)
- The interpolating element-free Galerkin method for the \(p\)-Laplace double obstacle mixed complementarity problem (Q6173966) (← links)
- Interior point methods for solving Pareto eigenvalue complementarity problems (Q6175565) (← links)
- Pseudomonotonicity of nonlinear transformations on Euclidean Jordan algebras (Q6178523) (← links)
- Bounded homotopy path approach to the solution of linear complementarity problems (Q6191719) (← links)
- Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games (Q6191973) (← links)
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)
- A projected splitting method for vertical tensor complementarity problems (Q6492457) (← links)
- Strict feasibility for the polynomial complementarity problem (Q6497039) (← links)
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints (Q6534829) (← links)
- Modulus-based block triangular splitting iteration method for solving the generalized absolute value equations (Q6543325) (← links)
- Modified inertial viscosity extrapolation method for solving quasi-monotone variational inequality and fixed point problems in real Hilbert spaces (Q6552077) (← links)
- A Jacobian smoothing inexact Newton method for solving the nonlinear complementary problem (Q6569075) (← links)
- On the two-stage multisplitting iteration methods for linear complementarity problems (Q6570993) (← links)
- A full approximation scheme multilevel method for nonlinear variational inequalities (Q6585309) (← links)
- Mixed Nonlinear Complementarity Problems via Nonlinear Optimization: Numerical Results on Multi-Rigid-Body Contact Problems with Friction (Q6586184) (← links)
- A two-step new modulus-based matrix splitting method for vertical linear complementarity problem (Q6586917) (← links)
- Modified two-step modulus-based matrix splitting iteration methods for implicit complementarity problems (Q6590194) (← links)
- On almost semimonotone matrices with non-positive off-diagonal elements and their generalizations (Q6592909) (← links)
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations (Q6596327) (← links)
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems (Q6596329) (← links)
- Relaxed modulus-based synchronous multisplitting multi-parameters TOR (two-parameters over-relaxation) methods for linear complementarity problems (Q6598197) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)
- The modulus-based matrix splitting method with inner iteration for a class of nonlinear complementarity problems (Q6612412) (← links)
- A accelerated modified shift-splitting method for nonsymmetric saddle point problems (Q6612505) (← links)
- MPCC: strong stability of weakly nondegenerate S-stationary points (Q6618209) (← links)
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling (Q6631573) (← links)
- Bounds of the solution set to the polynomial complementarity problem (Q6636781) (← links)
- Convergence-accelerated fixed-time dynamical methods for absolute value equations (Q6636803) (← links)
- Improved modulus-based matrix splitting iteration method for horizontal implicit complementarity problems (Q6644224) (← links)
- New modulus-based matrix splitting method for the vertical nonlinear complementarity problem (Q6653496) (← links)
- CVaR stochastic programming model for monotone stochastic tensor complementarity problem by using its penalized sample average approximation algorithm (Q6664936) (← links)