FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2072320751> ?p ?o ?g. }

• W2072320751 endingPage "1152" @default.
• W2072320751 startingPage "1141" @default.
• W2072320751 abstract "Gradient algorithms are the most commonly employed search methods in the routine optimization of IMRT plans. It is well known that local minima can exist for dose-volume-based and biology-based objective functions. The purpose of this paper is to compare the relative speed of different gradient algorithms, to investigate the strategies for accelerating the optimization process, to assess the validity of these strategies, and to study the convergence properties of these algorithms for dose-volume and biological objective functions. With these aims in mind, we implemented Newton's, conjugate gradient (CG), and the steepest decent (SD) algorithms for dose-volume- and EUD-based objective functions. Our implementation of Newton's algorithm approximates the second derivative matrix (Hessian) by its diagonal. The standard SD algorithm and the CG algorithm with “line minimization” were also implemented. In addition, we investigated the use of a variation of the CG algorithm, called the “scaled conjugate gradient” (SCG) algorithm. To accelerate the optimization process, we investigated the validity of the use of a “hybrid optimization” strategy, in which approximations to calculated dose distributions are used during most of the iterations. Published studies have indicated that getting trapped in local minima is not a significant problem. To investigate this issue further, we first obtained, by trial and error, and starting with uniform intensity distributions, the parameters of the dose-volume- or EUD-based objective functions which produced IMRT plans that satisfied the clinical requirements. Using the resulting optimized intensity distributions as the initial guess, we investigated the possibility of getting trapped in a local minimum. For most of the results presented, we used a lung cancer case. To illustrate the generality of our methods, the results for a prostate case are also presented. For both dose-volume and EUD based objective functions, Newton's method far outperforms other algorithms in terms of speed. The SCG algorithm, which avoids expensive “line minimization,” can speed up the standard CG algorithm by at least a factor of 2. For the same initial conditions, all algorithms converge essentially to the same plan. However, we demonstrate that for any of the algorithms studied, starting with previously optimized intensity distributions as the initial guess but for different objective function parameters, the solution frequently gets trapped in local minima. We found that the initial intensity distribution obtained from IMRT optimization utilizing objective function parameters, which favor a specific anatomic structure, would lead to a local minimum corresponding to that structure. Our results indicate that from among the gradient algorithms tested, Newton's method appears to be the fastest by far. Different gradient algorithms have the same convergence properties for dose-volume- and EUD-based objective functions. The hybrid dose calculation strategy is valid and can significantly accelerate the optimization process. The degree of acceleration achieved depends on the type of optimization problem being addressed (e.g., IMRT optimization, intensity modulated beam configuration optimization, or objective function parameter optimization). Under special conditions, gradient algorithms will get trapped in local minima, and reoptimization, starting with the results of previous optimization, will lead to solutions that are generally not significantly different from the local minimum." @default.
• W2072320751 created "2016-06-24" @default.
• W2072320751 creator A5008844169 @default.
• W2072320751 creator A5025660683 @default.
• W2072320751 creator A5031173656 @default.
• W2072320751 creator A5035804461 @default.
• W2072320751 creator A5041943880 @default.
• W2072320751 creator A5069570157 @default.
• W2072320751 date "2004-04-19" @default.
• W2072320751 modified "2023-10-16" @default.
• W2072320751 title "Speed and convergence properties of gradient algorithms for optimization of IMRT" @default.
• W2072320751 cites W1974908209 @default.
• W2072320751 cites W1976996553 @default.
• W2072320751 cites W1978090297 @default.
• W2072320751 cites W1980505464 @default.
• W2072320751 cites W1982203567 @default.
• W2072320751 cites W1983273276 @default.
• W2072320751 cites W1989008336 @default.
• W2072320751 cites W1991005992 @default.
• W2072320751 cites W1992073000 @default.
• W2072320751 cites W1993985030 @default.
• W2072320751 cites W2014438224 @default.
• W2072320751 cites W2024644980 @default.
• W2072320751 cites W2025258805 @default.
• W2072320751 cites W2035111930 @default.
• W2072320751 cites W2036975954 @default.
• W2072320751 cites W2037116662 @default.
• W2072320751 cites W2043821288 @default.
• W2072320751 cites W2047319364 @default.
• W2072320751 cites W2047588216 @default.
• W2072320751 cites W2048555863 @default.
• W2072320751 cites W2051812123 @default.
• W2072320751 cites W2072723582 @default.
• W2072320751 cites W2082564679 @default.
• W2072320751 cites W2094785545 @default.
• W2072320751 cites W2109037291 @default.
• W2072320751 cites W2110718955 @default.
• W2072320751 cites W2133388491 @default.
• W2072320751 cites W2138374178 @default.
• W2072320751 cites W2139127699 @default.
• W2072320751 cites W2147544224 @default.
• W2072320751 cites W2166010438 @default.
• W2072320751 doi "https://doi.org/10.1118/1.1688214" @default.
• W2072320751 hasPubMedId "https://pubmed.ncbi.nlm.nih.gov/15191303" @default.
• W2072320751 hasPublicationYear "2004" @default.
• W2072320751 type Work @default.
• W2072320751 sameAs 2072320751 @default.
• W2072320751 citedByCount "65" @default.
• W2072320751 countsByYear W20723207512012 @default.
• W2072320751 countsByYear W20723207512013 @default.
• W2072320751 countsByYear W20723207512014 @default.
• W2072320751 countsByYear W20723207512015 @default.
• W2072320751 countsByYear W20723207512016 @default.
• W2072320751 countsByYear W20723207512017 @default.
• W2072320751 countsByYear W20723207512018 @default.
• W2072320751 countsByYear W20723207512019 @default.
• W2072320751 countsByYear W20723207512020 @default.
• W2072320751 countsByYear W20723207512021 @default.
• W2072320751 countsByYear W20723207512022 @default.
• W2072320751 countsByYear W20723207512023 @default.
• W2072320751 crossrefType "journal-article" @default.
• W2072320751 hasAuthorship W2072320751A5008844169 @default.
• W2072320751 hasAuthorship W2072320751A5025660683 @default.
• W2072320751 hasAuthorship W2072320751A5031173656 @default.
• W2072320751 hasAuthorship W2072320751A5035804461 @default.
• W2072320751 hasAuthorship W2072320751A5041943880 @default.
• W2072320751 hasAuthorship W2072320751A5069570157 @default.
• W2072320751 hasConcept C111919701 @default.
• W2072320751 hasConcept C11413529 @default.
• W2072320751 hasConcept C126255220 @default.
• W2072320751 hasConcept C130367717 @default.
• W2072320751 hasConcept C132721684 @default.
• W2072320751 hasConcept C134306372 @default.
• W2072320751 hasConcept C137836250 @default.
• W2072320751 hasConcept C151319957 @default.
• W2072320751 hasConcept C153258448 @default.
• W2072320751 hasConcept C154945302 @default.
• W2072320751 hasConcept C162324750 @default.
• W2072320751 hasConcept C178635117 @default.
• W2072320751 hasConcept C186633575 @default.
• W2072320751 hasConcept C203616005 @default.
• W2072320751 hasConcept C2524010 @default.
• W2072320751 hasConcept C26362088 @default.
• W2072320751 hasConcept C2777303404 @default.
• W2072320751 hasConcept C28826006 @default.
• W2072320751 hasConcept C31258907 @default.
• W2072320751 hasConcept C33923547 @default.
• W2072320751 hasConcept C38652104 @default.
• W2072320751 hasConcept C41008148 @default.
• W2072320751 hasConcept C50522688 @default.
• W2072320751 hasConcept C50644808 @default.
• W2072320751 hasConcept C68339613 @default.
• W2072320751 hasConcept C81184566 @default.
• W2072320751 hasConcept C85522705 @default.
• W2072320751 hasConceptScore W2072320751C111919701 @default.
• W2072320751 hasConceptScore W2072320751C11413529 @default.
• W2072320751 hasConceptScore W2072320751C126255220 @default.
• W2072320751 hasConceptScore W2072320751C130367717 @default.

• next