A revised simplex algorithm for the absolute deviation curve fitting problem

1979 ◽  
Vol 8 (2) ◽  
pp. 175-190 ◽  
Author(s):  
Ronald D. Armstrong ◽  
E. L. Frome ◽  
D. S. Kung
2021 ◽  
Vol 15 ◽  
Author(s):  
Zhenghui Hu ◽  
Fei Li ◽  
Junhui Shui ◽  
Yituo Tang ◽  
Qiang Lin

Dynamic susceptibility contrast-enhanced magnetic resonance imaging is an important tool for evaluating intravascular indicator dynamics, which in turn is valuable for understanding brain physiology and pathophysiology. This procedure usually involves fitting a gamma-variate function to observed concentration-time curves in order to eliminate undesired effects of recirculation and the leakage of contrast agents. Several conventional curve-fitting approaches are routinely applied. The nonlinear optimization methods typically are computationally expensive and require reliable initial values to guarantee success, whereas a logarithmic linear least-squares (LL-LS) method is more stable and efficient, and does not suffer from the initial-value problem, but it can show degraded performance, especially when a few data or outliers are present. In this paper, we demonstrate, that the original perfusion curve-fitting problem can be transformed into a gamma-distribution-fitting problem by treating the concentration-time curves as a random sample from a gamma distribution with time as the random variable. A robust maximum-likelihood estimation (MLE) algorithm can then be readily adopted to solve this problem. The performance of the proposed method is compared with the nonlinear Levenberg-Marquardt (L-M) method and the LL-LS method using both synthetic and real data. The results show that the performance of the proposed approach is far superior to those of the other two methods, while keeping the advantages of the LL-LS method, such as easy implementation, low computational load, and dispensing with the need to guess the initial values. We argue that the proposed method represents an attractive alternative option for assessing intravascular indicator dynamics in clinical applications. Moreover, we also provide valuable suggestions on how to select valid data points and set the initial values in the two traditional approaches (LL-LS and nonlinear L-M methods) to achieve more reliable estimations.


2018 ◽  
Vol 77 (22) ◽  
pp. 30035-30050 ◽  
Author(s):  
Lili He ◽  
Hongtao Bai ◽  
Yu Jiang ◽  
Dantong Ouyang ◽  
Shanshan Jiang

1999 ◽  
Vol 66 ◽  
pp. S390-S402 ◽  
Author(s):  
Prasanta S. Bandyopadhyay ◽  
Robert J. Boik

2014 ◽  
Vol 6 (2) ◽  
pp. 46-62
Author(s):  
Nikolaos Ploskas ◽  
Nikolaos Samaras ◽  
Jason Papathanasiou

Linear programming algorithms have been widely used in Decision Support Systems. These systems have incorporated linear programming algorithms for the solution of the given problems. Yet, the special structure of each linear problem may take advantage of different linear programming algorithms or different techniques used in these algorithms. This paper proposes a web-based DSS that assists decision makers in the solution of linear programming problems with a variety of linear programming algorithms and techniques. Two linear programming algorithms have been included in the DSS: (i) revised simplex algorithm and (ii) exterior primal simplex algorithm. Furthermore, ten scaling techniques, five basis update methods and eight pivoting rules have been incorporated in the DSS. All linear programming algorithms and methods have been implemented using MATLAB and converted to Java classes using MATLAB Builder JA, while the web interface of the DSS has been designed using Java Server Pages.


Sign in / Sign up

Export Citation Format

Share Document