Comparison of the hybrid optimization with tolerance adjustment (HATA) with its parent algorithms of the SQP with user-supplied analytical gradient (SQP ∇user) and the STRiN with user-supplied analytical gradient and Hessian (STRiN ∇user Huser) as well as with other algorithms, such as SQP with numerical gradient by finite differentiation (SQP ∇finite), genetic algorithm (GA), and simulated annealing (SA) (A). All algorithms were initiated from an identical starting point. The objective function value at the ith iterate is registered only if f(Θ
) ≤ f(Θi-1). Time efficiency of the HATA represented by histogram plot of time taken for termination of 200 runs of optimization using different starting points (B).