Pages that link to "Item:Q1195287"

The following pages link to Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs (Q1195287):

Displaying 14 items.

• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs (Q1078096) (← links)
• Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem (Q1116899) (← links)
• Parallel Newton methods for the nonlinear complementarity problem (Q1116901) (← links)
• Decomposition algorithm for convex differentiable minimization (Q1176837) (← links)
• A note on the implementation of the successive overrelaxation method for linear complementarity problems (Q1208064) (← links)
• Descent methods for convex essentially smooth minimization (Q1321119) (← links)
• On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
• A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem (Q1338146) (← links)
• A modified projection algorithm for large strictly-convex quadratic programs (Q1579656) (← links)
• The adventures of a simple algorithm (Q1863543) (← links)
• Partially and totally asynchronous algorithms for linear complementarity problems (Q2277372) (← links)
• Parallel Implementation of Lemke's Algorithm on the Hypercube (Q4025896) (← links)