Pages that link to "Item:Q3936520"
From MaRDI portal
The following pages link to On the convergence of a block successive over-relaxation method for a class of linear complementarity problems (Q3936520):
Displaying 17 items.
- A new smoothing Newton method for solving constrained nonlinear equations (Q555395) (← links)
- On cone orderings and the linear complementarity problem (Q754772) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- More results on the convergence of iterative methods for the symmetric linear complementarity problem (Q1061019) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- Hidden Z-matrices with positive principal minors (Q1260088) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity. (Q1406258) (← links)
- On multilevel iterative methods for optimization problems (Q1813658) (← links)
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem (Q1837116) (← links)
- A multisplitting method for symmetric linear complementarity problems (Q1917824) (← links)
- Projected splitting methods for vertical linear complementarity problems (Q2139273) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem (Q6073134) (← links)
- A new matrix splitting generalized iteration method for linear complementarity problems (Q6090289) (← links)
- The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems (Q6099522) (← links)
