Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
From MaRDI portal
Publication:1078096
DOI10.1007/BF00940194zbMath0595.90090MaRDI QIDQ1078096
Olvi L. Mangasarian, Renato De Leone
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods, A parallel relaxation method for quadratic programming problems with interval constraints, Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem, Parallel Newton methods for the nonlinear complementarity problem, Multisplitting iteration schemes for solving a class of nonlinear complementarity problems, A multisplitting method for symmetric linear complementarity problems, Matrix multisplitting relaxation methods for linear complementarity problems, A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS, Projected successive overrelaxation method for finite-element solutions to the Dirichlet problem for a system of nonlinear elliptic equations, Block monotone iterative algorithms for variational inequalities with nonlinear operators, 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 matrix-splitting method for symmetric affine second-order cone complementarity problems, Partially and totally asynchronous algorithms for linear complementarity problems, Synchronous and asynchronous multisplitting iteration schemes for solving mixed linear complementarity problems with \(H\)-matrices, Splitting methods for constrained quadratic programs in data analysis, A modified projection algorithm for large strictly-convex quadratic programs, Block monotone iterative methods for elliptic variational inequalities., The adventures of a simple algorithm, Iteration grain sized asynchronous parallel algorithms in optimization
Cites Work
- Unnamed Item
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- Solution of symmetric linear complementarity problems by iterative methods
- Normal solutions of linear programs
