Pages that link to "Item:Q4376201"

The following pages link to Engineering and Economic Applications of Complementarity Problems (Q4376201):

Displaying 50 items.

• The solution set characterization and error bound for the extended mixed linear complementarity problem (Q1952792) (← links)
• Two new extragradient methods for solving equilibrium problems (Q1979343) (← links)
• Modified proximal-like extragradient methods for two classes of equilibrium problems in Hilbert spaces with applications (Q1983855) (← links)
• On construction of new NCP functions (Q1984678) (← links)
• Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems (Q1985273) (← links)
• Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem (Q1993073) (← links)
• A two-step modulus-based matrix splitting iteration method for solving nonlinear complementarity problems of \(H_+\)-matrices (Q1993522) (← links)
• Accelerated modulus-based matrix splitting iteration method for a class of nonlinear complementarity problems (Q1993595) (← links)
• A modified modulus-based multigrid method for linear complementarity problems arising from free boundary problems (Q1995940) (← links)
• An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
• The modulus-based matrix double splitting iteration method for linear complementarity problems (Q2004426) (← links)
• Multimodal transportation flows in energy networks with an application to crude oil markets (Q2005845) (← links)
• Two-step modulus-based matrix splitting iteration methods for implicit complementarity problems (Q2009061) (← links)
• A direct preconditioned modulus-based iteration method for solving nonlinear complementarity problems of \(H\)-matrices (Q2010757) (← links)
• A class of second-order cone eigenvalue complementarity problems for higher-order tensors (Q2014672) (← links)
• An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix (Q2033076) (← links)
• Two-stage stochastic variational inequalities: theory, algorithms and applications (Q2033981) (← links)
• Convexification techniques for linear complementarity constraints (Q2045009) (← links)
• A generalized modulus-based Newton method for solving a class of non-linear complementarity problems with \(P\)-matrices (Q2066231) (← links)
• Iteration complexity of generalized complementarity problems (Q2067800) (← links)
• A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
• A preconditioned general two-step modulus-based accelerated overrelaxation iteration method for nonlinear complementarity problems (Q2070153) (← links)
• Some results on the filter method for nonlinear complementary problems (Q2072787) (← links)
• A new class of neural networks for NCPs using smooth perturbations of the natural residual function (Q2075986) (← links)
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
• On linear problems with complementarity constraints (Q2080820) (← links)
• Fast modulus-based matrix splitting iteration methods for implicit complementarity problems (Q2085647) (← links)
• A fast stochastic approximation-based subgradient extragradient algorithm with variance reduction for solving stochastic variational inequality problems (Q2087495) (← links)
• Newton's method for solving generalized equations without Lipschitz condition (Q2115251) (← links)
• Structure probing neural network deflation (Q2124019) (← links)
• On the convergence of two-step modulus-based matrix splitting iteration method (Q2134993) (← links)
• A new subclass of \(Q_0\)-matrix in linear complementarity theory (Q2135533) (← links)
• Dimension extending technique for constitutive integration of plasticity with hardening-softening behaviors (Q2136698) (← links)
• A new iterative algorithm for general variational inequality problem with applications (Q2138162) (← links)
• The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems (Q2140763) (← links)
• The convergence of modulus-based matrix splitting iteration methods for implicit complementarity problems (Q2141569) (← links)
• Two strongly convergent methods governed by pseudo-monotone bi-function in a real Hilbert space with applications (Q2143878) (← links)
• Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm (Q2171124) (← links)
• The reduced order method for solving the linear complementarity problem with an \(M\)-matrix (Q2172919) (← links)
• Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem (Q2174476) (← links)
• A projection algorithm for non-monotone variational inequalities (Q2174926) (← links)
• Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints (Q2178885) (← links)
• Numerical solution of an obstacle problem with interval coefficients (Q2178955) (← links)
• A generalized Newton method for a class of discrete-time linear complementarity systems (Q2184087) (← links)
• New error bounds for linear complementarity problems of \(\Sigma \)-SDD matrices and \(SB\)-matrices (Q2189191) (← links)
• Pricing options on investment project contraction and ownership transfer using a finite volume scheme and an interior penalty method (Q2190271) (← links)
• A class of modified modulus-based synchronous multisplitting iteration methods for linear complementarity problems (Q2192570) (← links)
• An interior penalty approach to a large-scale discretized obstacle problem with nonlinear constraints (Q2200796) (← links)
• The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems (Q2203800) (← links)
• Linear complementarity problems and bi-linear games. (Q2216229) (← links)