Pages that link to "Item:Q1129813"
From MaRDI portal
The following pages link to A class of generalized multisplitting relaxation methods for linear complementarity problems (Q1129813):
Displaying 12 items.
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (Q550095) (← links)
- Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with \(H\)-matrices (Q727227) (← links)
- A multisplitting method for symmetric linear complementarity problems (Q1917824) (← links)
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
- On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement (Q2115319) (← links)
- The PMCGAOR and PMCSSOR methods for solving linear complementarity problems (Q2342902) (← links)
- Inexact multisplitting methods for linear complementarity problems (Q2378248) (← links)
- Relaxed asynchronous iterations for the linear complementarity problem (Q2780726) (← links)
- Coordinate relaxation methods for multivalued complementarity problems (Q3652442) (← links)
- On the monotone convergence of matrix multisplitting relaxation methods for the linear complementarity problem (Q4223837) (← links)
- A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS (Q4347261) (← links)
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods (Q4780533) (← links)