Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs

DOI10.1007/BF02186473zbMath0739.90068OpenAlexW1971981746MaRDI QIDQ1195287

Renato De Leone, Olvi L. Mangasarian

Publication date: 18 October 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02186473

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem ⋮ Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem ⋮ Parallel Newton methods for the nonlinear complementarity problem ⋮ Decomposition algorithm for convex differentiable minimization ⋮ A coordinate gradient descent method for nonsmooth separable minimization ⋮ Partially and totally asynchronous algorithms for linear complementarity problems ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ A modified projection algorithm for large strictly-convex quadratic programs ⋮ The adventures of a simple algorithm ⋮ Descent methods for convex essentially smooth minimization ⋮ On the convergence of the coordinate descent method for convex differentiable minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• 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
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• Normal solutions of linear programs
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems

This page was built for publication: Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs