2004
DOI: 10.1088/0031-9155/49/4/010
|View full text |Cite
|
Sign up to set email alerts
|

The dose–volume constraint satisfaction problem for inverse treatment planning with field segments

Abstract: Abstract. The prescribed goals of radiation treatment planning are often expressed in terms of dose-volume constraints. We present a novel formulation of a dose-volume constraint satisfaction search for the discretized radiation therapy model. This approach does not rely on any explicit cost function. The inverse treatment planning uses the aperture based approach with predefined, according to geometric rules, segmental fields. The solver utilizes the simultaneous version of the cyclic subgradient projection a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
23
0

Year Published

2008
2008
2013
2013

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(24 citation statements)
references
References 27 publications
1
23
0
Order By: Relevance
“…15,16 Segment-based optimization algorithms achieve small numbers of segments by imposing the physical constraints of beam apertures in the optimization. [7][8][9][10][11][12][13][14]28 In a sense, this is similar to what many investigators have done in the context of 3D conformal therapy plan optimization, where the machine related parameters such as the beam weights and wedge angles are optimized. These algorithms eventually search in a space of all possible segments for a sparse optimal solution.…”
supporting
confidence: 53%
See 1 more Smart Citation
“…15,16 Segment-based optimization algorithms achieve small numbers of segments by imposing the physical constraints of beam apertures in the optimization. [7][8][9][10][11][12][13][14]28 In a sense, this is similar to what many investigators have done in the context of 3D conformal therapy plan optimization, where the machine related parameters such as the beam weights and wedge angles are optimized. These algorithms eventually search in a space of all possible segments for a sparse optimal solution.…”
supporting
confidence: 53%
“…Segment-based methods tackle the problem from the delivery aspect typically by enforcing a prechosen ͑often unjustified͒ number of segments for each incident beam and then optimizing the shapes and weights of the apertures. [7][8][9][10][11][12][13][14] However, searching for an optimal solution by using segmentbased optimization is inherently complicated because of the highly nonconvex dependence of the objective function on the multi-leaf collimator ͑MLC͒ coordinates and the optimality of the final solution is not always guaranteed when an iterative algorithm is used.…”
Section: Introductionmentioning
confidence: 99%
“…Starkschall et al (2001) modify the cyclic subgradient projection algorithm to incorporate dose-volume constraints. Michalski et al (2004) solve dose-volume constraint satisfaction problems using the simultaneous subgradient projection algorithm. They state that the algorithm is easy to implement and has minimal memory requirements.…”
Section: The Feasibility Problem and Algorithmsmentioning
confidence: 99%
“…IMRT inverse planning can be broadly divided into two types of optimization algorithms: direct aperture optimization (DAO) (Refs. [8][9][10][11][12]) and beamlet based optimization (BBO). [13][14][15][16][17][18] Although DAO takes the physical constraints of the delivery system into consideration, it suffers from the problem of multiple local minima due to the nonconvex cost function.…”
Section: Introductionmentioning
confidence: 99%