1993
DOI: 10.1016/0360-3016(93)90972-x
|View full text |Cite
|
Sign up to set email alerts
|

The reliability of optimization under dose-volume limits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

1995
1995
2004
2004

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…In the theoretical situation, the number of constraint points was limited to 100 in the target and each OAR, and the time limit was set to 15 days to allow for the MILP technique to find the global optimum or a solution quite close to the global optimum. In the clinical situation, the number of constraint points was set to 500 in the target and each OAR, so that dose-volume evaluations had an accuracy of 3% to 4% (Langer et al 1993). The time limit was set to half an hour, which was thought to be within the clinically acceptable range.…”
Section: Data Collectionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the theoretical situation, the number of constraint points was limited to 100 in the target and each OAR, and the time limit was set to 15 days to allow for the MILP technique to find the global optimum or a solution quite close to the global optimum. In the clinical situation, the number of constraint points was set to 500 in the target and each OAR, so that dose-volume evaluations had an accuracy of 3% to 4% (Langer et al 1993). The time limit was set to half an hour, which was thought to be within the clinically acceptable range.…”
Section: Data Collectionmentioning
confidence: 99%
“…The third technique, also proposed by Langer et al (1990), is to model the treatment planning optimization accurately in a mixed integer linear programming problem (MILP) that can be solved by solving a sequence of linear programming relaxation problems with the branch-and-bound technique. The number of integer variables (or, more strictly, binary variables) is the number of constraint points in OARs, which must number at least in the hundreds in each OAR to achieve an accuracy of 3% to 4% for dose-volume evaluations (Langer et al 1993). Therefore, there will be hundreds to thousands of these constraint points.…”
Section: Introductionmentioning
confidence: 99%
“…An important issue in inverse planning is how to formalize the clinical goals to objectively evaluate the figures of merit of different IMRT plans. Despite intense research effort in modelling the clinical decision-making strategies (Amols and Ling 2002, Deasy et al 2002, Earl et al 2003, Hou et al 2003, Lahanas et al 2003, Langer et al 1993, Lee et al 2000, Llacer et al 2001, Mohan et al 1994, Webb 2004, Xing et al 1999, Yan et al 2003, the appropriate form of the objective function remains illusive. Presently, two types of objective functions are widely used: dose or dose-volume histogram (DVH)-based (physical objective functions) (Chen et al 2002, Cho et al 1998, Holmes et al 1995, Hristov et al 2002, Michalski et al 2004, Starkschall et al 2001, Shepard et al 2002, Xing et al 1998 and dose-response-based objective functions (biological objective functions) (Brahme 2001, Kallman et al 1992, Miften et al 2004, Mohan et al 1992, Wang et al 1995, Webb and Nahum 1993.…”
Section: Introductionmentioning
confidence: 99%
“…[7][8][9] Among the treatment planning optimization techniques based on physical objective functions, the model of partial dose-volume constraints may be the most clinically relevant one. [7][8][9][10][11][12][13] Within this model, various objectives are pursued under constraints demanding that fractional volumes of critical structures do not receive more than certain dose limits, e.g., no more than 30% of the lung volume may receive more than 20 Gy. A maximum dose constraint to a critical organ can be expressed by a partial dose volume constraint through the requirement that no more than 0% of the volume can get more than the specified maximum dose.…”
Section: Introductionmentioning
confidence: 99%
“…Several minimization techniques have been proposed as optimization engines for problems involving dose-volume objective functions and constraints. [8][9][10][11][12][13][14][15][16][17][18][19] While stochastic algorithms [15][16][17][18]20 have the theoretical advantage of being able to escape from local minima present in optimization problems with dose-volume objective functions, 21 gradient algorithms are a few orders of magnitude faster. Furthermore, as argued by Bortfeld, 7 gradient algorithms are generally adequate for inverse planning because ͑i͒ different local minima can be promptly explored from different starting points and ͑ii͒ the value of the objective function at the local minima is often not too different from its value at the global minimum.…”
Section: Introductionmentioning
confidence: 99%