Conjugate gradient methods form a class of iterative algorithms that are highly effective for solving large‐scale unconstrained optimisation problems. They achieve efficiency by constructing search ...
SIAM Journal on Numerical Analysis, Vol. 20, No. 3 (Jun., 1983), pp. 626-637 (12 pages) Algorithms based on trust regions have been shown to be robust methods for unconstrained optimization problems.
SIAM Journal on Numerical Analysis, Vol. 41, No. 2 (2004), pp. 589-604 (16 pages) We study the computation of the orthogonal spline collocation solution of a linear Dirichlet boundary value problem ...
There are several optimization techniques available in PROC NLMIXED. You can choose a particular optimizer with the TECH=name option in the PROC NLMIXED statement. No algorithm for optimizing general ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback