Pages that link to "Item:Q3363081"

The following pages link to On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem (Q3363081):

Displaying 17 items.

• Improved convergence theorems of multisplitting methods for the linear complementarity problem (Q280082) (← links)
• A multiplicative multisplitting method for solving the linear complementarity problem (Q979813) (← links)
• An inexact NE/SQP method for solving the nonlinear complementarity problem (Q1202586) (← links)
• Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
• Descent methods for convex essentially smooth minimization (Q1321119) (← links)
• On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
• Modified AOR methods for linear complementarity problem (Q1406219) (← links)
• Overlapping restricted additive Schwarz method with damping factor for \(H\)-matrix linear complementarity problem (Q1732154) (← links)
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results (Q1803603) (← links)
• The adventures of a simple algorithm (Q1863543) (← links)
• Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
• A multisplitting method for symmetric linear complementarity problems (Q1917824) (← links)
• A preconditioned multisplitting and Schwarz method for linear complementarity problem (Q2336502) (← links)
• On the convergence of iterative methods for symmetric linear complementarity problems (Q2366607) (← links)
• Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization (Q2954396) (← links)
• Why Do Similarity Matching Objectives Lead to Hebbian/Anti-Hebbian Networks? (Q5157107) (← links)
• A Hebbian/Anti-Hebbian Neural Network for Linear Subspace Learning: A Derivation from Multidimensional Scaling of Streaming Data (Q5380287) (← links)