Why the study?
Non-convex minimization in arterial parameter identification risks finding incorrect local minima, prompting investigation of a branch-and-bound algorithm for global optimality.
While a branch-and-bound algorithm can identify mechanical properties of arteries to global optimality, the computational process is highly time-consuming.
Answers are grounded in this paper and cite their sources.
Computational demands limit routine arterial mechanics modeling; leaves open whether multi-start initialization alone enables reliable global solutions.
In this study, we consider identification of parameters in a non-linear continuum-mechanical model of arteries by fitting the models response to clinical data. The fitting of the model is formulated as a constrained non-linear, non-convex least-squares minimization problem. The model parameters are directly related to the underlying physiology of arteries, and correctly identified they can be of great clinical value. The non-convexity of the minimization problem implies that incorrect parameter values, corresponding to local minima or stationary points may be found, however. Therefore, we investigate the feasibility of using a branch-and-bound algorithm to identify the parameters to global optimality. The algorithm is tested on three clinical data sets, in each case using four increasingly larger regions around a candidate global solution in the parameter space. In all cases, the candidate global solution is found already in the initialization phase when solving the original non-convex minimization problem from multiple starting points, and the remaining time is spent on increasing the lower bound on the optimal value. Although the branch-and-bound algorithm is parallelized, the overall procedure is in general very time-consuming.
No takes yet. Share an insight, caveat, or question.
Gade et al. (2021) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: