Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
From MaRDI portal
A parallel successive overrelaxation (SOR) method is proposed for the solution of the fundamental symmetric linear complementarity problem. Convergence is established under a relaxation factor which approaches the classical value of 2 for a loosely coupled problem. The parallel SOR approach is then applied to solve the symmetric linear complementarity problem associated with the least norm solution of a linear program.
Recommendations
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- scientific article; zbMATH DE number 4152174
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- scientific article; zbMATH DE number 4059113
- A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
Cites work
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- Normal solutions of linear programs
- Solution of symmetric linear complementarity problems by iterative methods
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
Cited in
(31)- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- An LP-based successive overrelaxation method for linear complementarity problems
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- Parallel Newton methods for the nonlinear complementarity problem
- Projected successive overrelaxation method for finite-element solutions to the Dirichlet problem for a system of nonlinear elliptic equations
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
- A note on the implementation of the successive overrelaxation method for linear complementarity problems
- A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
- A modified projection algorithm for large strictly-convex quadratic programs
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- Symmetric SOR method for absolute complementarity problems
- Splitting methods for constrained quadratic programs in data analysis
- Block monotone iterative methods for elliptic variational inequalities.
- The adventures of a simple algorithm
- A parallel relaxation method for quadratic programming problems with interval constraints
- A multisplitting method for symmetric linear complementarity problems
- Partially and totally asynchronous algorithms for linear complementarity problems
- scientific article; zbMATH DE number 3890636 (Why is no real title available?)
- scientific article; zbMATH DE number 3852799 (Why is no real title available?)
- scientific article; zbMATH DE number 4059113 (Why is no real title available?)
- Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems
- Iteration grain sized asynchronous parallel algorithms in optimization
- Matrix multisplitting relaxation methods for linear complementarity problems
- A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
- scientific article; zbMATH DE number 1791155 (Why is no real title available?)
- Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
- scientific article; zbMATH DE number 773163 (Why is no real title available?)
- Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with H-matrices
- Multisplitting iteration schemes for solving a class of nonlinear complementarity problems
- Block monotone iterative algorithms for variational inequalities with nonlinear operators
This page was built for publication: Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078096)