Weak and strong superiorization: between feasibility-seeking and minimization

From MaRDI portal
Publication:2806693

zbMATH Open1349.90675arXiv1410.0130MaRDI QIDQ2806693FDOQ2806693


Authors: Yair Censor Edit this on Wikidata


Publication date: 18 May 2016

Published in: Analele Științifice ale Universității ``Ovidius Constanța. Seria: Matematică (Search for Journal in Brave)

Abstract: We review the superiorization methodology, which can be thought of, in some cases, as lying between feasibility-seeking and constrained minimization. It is not quite trying to solve the full fledged constrained minimization problem; rather, the task is to find a feasible point which is superior (with respect to an objective function value) to one returned by a feasibility-seeking only algorithm. We distinguish between two research directions in the superiorization methodology that nourish from the same general principle: Weak superiorization and strong superiorization and clarify their nature.


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




Recommendations





Cited In (28)





This page was built for publication: Weak and strong superiorization: between feasibility-seeking and minimization

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