Data Entry: Please note that the research database will be replaced by UNIverse by the end of October 2023. Please enter your data into the system https://universe-intern.unibas.ch. Thanks

Login for users with Unibas email account...

Login for registered users without Unibas email account...

 
A Parallel PDE-Constrained Optimization Framework for Biomedical Hyperthermia Treatment Planning
ConferencePaper (Artikel, die in Tagungsbänden erschienen sind)
 
ID 136209
Author(s) Sathe, Madan; Schenk, Olaf; Christen, Matthias; Burkhart, Helmar:
Author(s) at UniBasel Schenk, Olaf
Burkhart, Helmar
Christen, Matthias
Sathe, Madan
Year 2009
Year: comment 2009
Title A Parallel PDE-Constrained Optimization Framework for Biomedical Hyperthermia Treatment Planning
Book title (Conference Proceedings) Mitteilungen / GI, Gesellschaft für Informatik e.V., Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware, PARS ; ITG, Informationstechnische Gesellschaft im VDE Nr. 26. (Workshop 2009)
Place of Conference Parsberg in der Oberpfalz, Deutschland
Year of Conference 2009
Publisher PARS
Place of Publication Erlangen
Pages S. 1
ISSN/ISBN 0177-0454
Keywords PDE-constrained optimization, large-scale parallel optimization, biomedical application, sparse linear solver, parallel weighted matching algorithm, graph partitioning
Abstract We present a PDE-constrained optimization algorithm which is designed for parallel scalability on distributed-memory architectures with thousands of cores.The method is based on a line-search interior-point algorithm for large-scale continuous optimization, it is matrix-free in that it does not require the factorization of derivative matrices. Instead, ituses a new parallel and robust iterative linear solver on distributed-memory architectures.We will show almost linear parallel scalability results with 256 cores for the optimization problem, which is anemerging biomedical application and is related to antenna identification in hyperthermia cancer treatment planning. Additionally, we will discuss two combinatorial problem, parallel matchingalgorithms and graph partitioning, which could further enhance the parallel scalability of general nonlinear optimization solvers.
URL http://fgb.informatik.unibas.ch/people/sathe_madan/publications/references/pars09.pdf
edoc-URL http://edoc.unibas.ch/dok/A5254981
Full Text on edoc No
Additional Information Note: Erschienen im Tagungsband zum PARS-Workshop 04.-05. Juni 2009, Parsberg in der Oberpfalz, Deutschland
 
   

MCSS v5.8 PRO. 0.337 sec, queries - 0.000 sec ©Universität Basel  |  Impressum   |    
20/04/2024