CTA

Sparse Hessian factorization in curved trajectories for unconstrained minimization. A curved trajectories algorithm (CTA) is a package for the minimization of unconstrained functions of several variables with intervals on the variables. The core algorithm is novel in that steps may follow polynomial space curves instead of straight lines. The space curves result from truncations of a Taylor series expansion of the gradient inverse function. A critical item in the efficiency of CTA is the factorization of the sparse Hessian matrix and handling a non-positive definite Hessian. This paper describes a new approach for nonpositive definite Hessians that has given robust results, especially for ill-conditioned problems and the CTA package compares very favourably with other minimization packages using a sample of large CUTEr problems (cf. [{it N. I. M. Gould} et al., ACM Trans. Math. Softw. 29, No. 4, 373--394 (2003; Zbl 1068.90526)]).

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element


References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Jiménez, Alberto J.: Sparse Hessian factorization in curved trajectories for unconstrained minimization (2014)