Paper detail

Guaranteed $ε$-optimal solutions with the linear optimizer ART3+O

The linear optimization algorithm ART3+O introduced by Chen et al. (2010) can efficiently solve large scale inverse planning problems encountered in radiation therapy by iterative projection. Its major weakness is that it cannot guarantee $ε$-optimality of the final solution due to an arbitrary stopping criterion. We propose an improvement to ART3+O where the stopping criterion is based on Farkas' lemma. The same theory can be used to detect inconsistency in other projection methods as well. The proposed algorithm guarantees to find an $ε$-optimal solution in finite time. The algorithm is demonstrated on numerical examples in radiation therapy.

preprint2021arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.