Pages that link to "Item:Q1188288"

The following pages link to A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288):

Displaying 50 items.

• Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method (Q447558) (← links)
• A feasible decomposition method for constrained equations and its application to complementarity problems (Q475708) (← links)
• Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs (Q613225) (← links)
• Minisum location problem with farthest Euclidean distances (Q857948) (← links)
• Solving linear variational inequality problems by a self-adaptive projection method (Q858851) (← links)
• Conjugate gradient method for the linear complementarity problem withs-matrix (Q1007676) (← links)
• Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods (Q1129805) (← links)
• Solution of projection problems over polytopes (Q1185491) (← links)
• Extended projection methods for monotone variational inequalities (Q1281975) (← links)
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities (Q1306392) (← links)
• On a class of iterative projection and contraction methods for linear programming (Q1321374) (← links)
• New contraction methods for linear inequalities (Q1334912) (← links)
• Solving a class of linear projection equations (Q1338824) (← links)
• An iterative two-step algorithm for linear complementarity problems (Q1338826) (← links)
• A new method for a class of linear variational inequalities (Q1340052) (← links)
• A class of iterative methods for solving nonlinear projection equations (Q1359468) (← links)
• A new method for a class of nonlinear variational inequalities with fuzzy mappings (Q1375859) (← links)
• New decomposition methods for solving variational inequality problems. (Q1410985) (← links)
• A self-adaptive projection and contraction method for linear complementarity problems (Q1430530) (← links)
• Solving a class of asymmetric variational inequalities by a new alternating direction method (Q1591954) (← links)
• New alternating direction method for a class of nonlinear variational inequality problems (Q1599285) (← links)
• Projective algorithms for solving complementarity problems (Q1607818) (← links)
• A self-adaptive projection and contraction method for monotone symmetric linear variational inequalities. (Q1609034) (← links)
• Two new self-adaptive projection methods for variational inequality problems (Q1609083) (← links)
• A new stepsize rule in He and Zhou's alternating direction method (Q1609450) (← links)
• A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems (Q1767898) (← links)
• Role of twice Fréchet-differentiable mappings in general auxiliary problem principle (Q1827262) (← links)
• Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
• Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities (Q1887951) (← links)
• A Newton-type method for positive-semidefinite linear complementarity problems (Q1905937) (← links)
• Decomposition method for a class of monotone variational inequality problems (Q1964713) (← links)
• A modified alternating direction method for convex minimization problems (Q1975294) (← links)
• A class of projection and contraction methods for asymmetric linear variational inequalities and their relations to Fukushima's descent method (Q1975701) (← links)
• General fixed-point method for solving the linear complementarity problem (Q2142788) (← links)
• The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense (Q2346285) (← links)
• A class of projection and contraction methods for monotone variational inequalities (Q2365244) (← links)
• A rapid algorithm for a class of linear complementarity problems (Q2372045) (← links)
• A fast continuous method for the extreme eigenvalue problem (Q2397597) (← links)
• A new class of projection and contraction methods for solving variational inequality problems (Q2475884) (← links)
• A modified descent method for co-coercive variational inequalities (Q2480969) (← links)
• A variable metric proximal-descent algorithm for monotone operators (Q2511031) (← links)
• A new projection and contraction method for linear variational inequalities (Q2581476) (← links)
• A projection and contraction method for convex quadratic programming (Q2719688) (← links)
• A linear combinatorial projection method for a class of generalized implicit complementarity problems (Q2924318) (← links)
• Iterative learning control for constrained linear systems (Q3161171) (← links)
• The iterative methods for monotone generalized variational inequalities (Q4375432) (← links)
• 3D DDA Based on Variational Inequality Theory and Its Solution Scheme (Q4962585) (← links)
• A projection and contraction method for symmetric cone complementarity problem (Q5238193) (← links)
• An adaptive multi-step Levenberg-Marquardt method for nonlinear complementarity problem (Q5868465) (← links)
• Local convergence behavior of some projection-type methods for affine variational inequalities (Q5929432) (← links)