Methods for solving systems of linear and convex inequalities based on the Fejér principle

DOI10.1134/S0081543811020039zbMATH Open1254.90164OpenAlexW2042731317MaRDI QIDQ643803

Ivan I. Eremin

Publication date: 2 November 2011

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543811020039

zbMATH Keywords

fixed point setprojection operatorcontraction mappingsFejér processes

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Related Items (4)

Title not available (Why is that?) ⋮ Solution of parametrized linear inequalities by Fourier elimination and its applications ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)

This page was built for publication: Methods for solving systems of linear and convex inequalities based on the Fejér principle

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