Can linear superiorization be useful for linear optimization problems?
From MaRDI portal
Publication:5346625
DOI10.1088/1361-6420/33/4/044006zbMath1397.90261arXiv1612.06533WikidataQ47563107 ScholiaQ47563107MaRDI QIDQ5346625
Publication date: 26 May 2017
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.06533
linear programming; simplex algorithm; bounded perturbation resilience; superiorization; feasibility-seeking; Agmon-Motzkin-Schoenberg algorithm
90C05: Linear programming
Uses Software