Linear Superiorization for Infeasible Linear Programming

DOI10.1007/978-3-319-44914-2_2zbMath1391.90405arXiv1612.06997OpenAlexW2557680031MaRDI QIDQ3133197

Yehuda Zur, Yair Censor

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.06997

zbMATH Keywords

proximity functionsuperiorizationperturbation resiliencesimultaneous projection algorithmfeasibility-seekingcimmino methodinfeasible linear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (3)

Approximate solutions of common fixed point problems with infinitely many operators ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ An analysis of the superiorization method via the principle of concentration of measure

This page was built for publication: Linear Superiorization for Infeasible Linear Programming