A class of methods for solving large convex systems

DOI10.1016/0167-6377(90)90017-YMaRDI QIDQ1813379zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A simultaneous projections method for linear inequalities
• New iterative methods for linear inequalities
• Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
• scientific article; zbMATH DE number 776085
• scientific article; zbMATH DE number 16987

Cites work

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

Cited in

(5)

• Block-iterative surrogate projection methods for convex feasibility problems
• A CONVEX APPROXIMATION METHOD FOR LARGE SCALE LINEAR INEQUALITY CONSTRAINED MINIMIZATION
• Convex constrained optimization for large-scale generalized Sylvester equations
• A superlinearly convergent projection algorithm for solving the convex inequality problem
• A convex optimization approach for solving large scale linear systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813379)