A class of methods for solving large convex systems

DOI10.1016/0167-6377(90)90017-YzbMath0784.65058OpenAlexW2036697560MaRDI QIDQ1813379

Ubaldo M. García-Palomares

Publication date: 25 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90017-y

zbMATH Keywords

aggregation algorithmssimultaneous projection algorithmlarge system of convex inequalities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (2)

Block-iterative surrogate projection methods for convex feasibility problems ⋮ A superlinearly convergent projection algorithm for solving the convex inequality problem

Cites Work

• On relaxation methods for systems of linear inequalities
• Convergence of the cyclical relaxation method for linear inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities
• Modifications and implementation of the ellipsoid algorithm for linear programming
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: A class of methods for solving large convex systems