Pages that link to "Item:Q1231762"

The following pages link to Solution of symmetric linear complementarity problems by iterative methods (Q1231762):

Displaying 50 items.

• A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems (Q2037902) (← links)
• A preconditioned general two-step modulus-based accelerated overrelaxation iteration method for nonlinear complementarity problems (Q2070153) (← links)
• A generalization of the equivalence relations between modulus-based and projected splitting methods (Q2084585) (← links)
• A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems (Q2114416) (← links)
• A class of new modulus-based matrix splitting methods for linear complementarity problem (Q2136881) (← links)
• Projected splitting methods for vertical linear complementarity problems (Q2139273) (← links)
• Two new iteration methods with optimal parameters for solving absolute value equations (Q2149329) (← links)
• Numerical solution of the absolute value equations using two matrix splitting fixed point iteration methods (Q2158465) (← links)
• Upper norm bounds for the inverse of locally doubly strictly diagonally dominant matrices with its applications in linear complementarity problems (Q2159420) (← links)
• A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem (Q2175368) (← links)
• A fixed point iterative method for tensor complementarity problems (Q2199699) (← links)
• The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems (Q2203800) (← links)
• A rigorous and efficient explicit algorithm for irreversibility enforcement in phase-field finite element modeling of brittle crack propagation (Q2246367) (← links)
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming (Q2277367) (← links)
• Partially and totally asynchronous algorithms for linear complementarity problems (Q2277372) (← links)
• A preconditioned general two-step modulus-based matrix splitting iteration method for linear complementarity problems of \(H_+\)-matrices (Q2334811) (← links)
• A preconditioned multisplitting and Schwarz method for linear complementarity problem (Q2336502) (← links)
• On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method (Q2347573) (← links)
• Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems (Q2360673) (← links)
• A generalized Newton method for non-Hermitian positive definite linear complementarity problem (Q2363671) (← links)
• On the convergence of iterative methods for symmetric linear complementarity problems (Q2366607) (← links)
• Generalized AOR methods for linear complementarity problem (Q2371393) (← links)
• A rapid algorithm for a class of linear complementarity problems (Q2372045) (← links)
• A decomposition algorithm for solving large-scale quadratic programming problems (Q2489180) (← links)
• Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an \(H_+\)-matrix (Q2511204) (← links)
• Complementarity problems in semi-inner product spaces (Q2638479) (← links)
• The nonlinear lopsided HSS-like modulus-based matrix splitting iteration method for linear complementarity problems with positive-definite matrices (Q2667341) (← links)
• The new iteration methods for solving absolute value equations. (Q2685401) (← links)
• Solving tensor complementarity problems with \(Z\)-tensors via a weighted fixed point method (Q2691331) (← links)
• A note on the MSMAOR method for linear complementarity problems (Q2805663) (← links)
• The modulus-based matrix splitting algorithms for a class of weakly nonlinear complementarity problems. (Q2829114) (← links)
• A Fast NCP Solver for Large Rigid-Body Problems with Contacts, Friction, and Joints (Q2937991) (← links)
• Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems (Q2955973) (← links)
• A modified modulus method for symmetric positive-definite linear complementarity problems (Q3011668) (← links)
• Bi-criteria optimal control of redundant robot manipulators using LVI-based primal-dual neural network (Q3057004) (← links)
• Modulus-based matrix splitting iteration methods for linear complementarity problems (Q3090806) (← links)
• Newton's method for linear complementarity problems (Q3316988) (← links)
• (Q3354482) (← links)
• A fast learning algorithm for training feedforward neural networks (Q3437455) (← links)
• A finite algorithm for the least two-norm solution of a linear program¹ (Q3778542) (← links)
• Iterative algorithms for the linear complementarity problem (Q3800997) (← links)
• A dual differentiable exact penalty function (Q3959752) (← links)
• Iterative methods for variational and complementarity problems (Q3965925) (← links)
• Matrix multisplitting relaxation methods for linear complementarity problems (Q4340160) (← links)
• A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS (Q4347261) (← links)
• A GENERALIZED VARIABLE FORMULATION FOR GRADIENT DEPENDENT SOFTENING PLASTICITY (Q4360624) (← links)
• Random test problems and parallel methods for quadratic programs and quadratic stochastic programs^∗ (Q4514287) (← links)
• Foreword: special issue for the 70th birthday of professor Olvi Mangasarian (Q4657700) (← links)
• Iterative methods for linear complementarity problems with upperbounds on primary variables (Q4744082) (← links)
• Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods (Q4780533) (← links)