Under and over projection methods for solving linear inequality systems

MaRDI QIDQ2844654zbMATH OpenFDO

Authors Enrique González-Guttiérrez, Lidia Hernandez Rebollar, Maxim Ivanov Todorov

Publication date 29 August 2013

Published in Doklady Bolgarskoĭ Akademii Nauk (Search for Journal in Brave)

zbMATH Keywords

numerical methodsfeasibility problemlinear inequality systems

Mathematics Subject Classification ID

Numerical methods for variational inequalities and related problems (65K15) Semi-infinite programming (90C34)

Recommendations

• scientific article; zbMATH DE number 776085
• A simultaneous projections method for linear inequalities
• A projection method for least-squares solutions to overdetermined systems of linear inequalities
• A relaxation method for solving systems with infinitely many linear inequalities
• Rate of convergence of a class of numerical methods solving linear inequality systems

Cited in

(10)

• scientific article; zbMATH DE number 776085 (Why is no real title available?)
• A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
• Interval-based projection method for under-constrained numerical systems
• Relaxation methods for solving linear inequality systems: converging results
• scientific article; zbMATH DE number 4070201 (Why is no real title available?)
• Rate of convergence of a class of numerical methods solving linear inequality systems
• The Minimax Solution of Linear Equations Subject to Linear Constraints
• A projection method for least-squares solutions to overdetermined systems of linear inequalities
• Locally polynomial method for solving systems of linear inequalities

This page was built for publication: Under and over projection methods for solving linear inequality systems

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