The NEOS Server offers TRON for the solution of large bound constrained nonlinear optimization problems. TRON, a trust region Newton method, uses a gradient projection method to generate a Cauchy step, a preconditioned conjugate gradient method with an incomplete Cholesky factorization to generate a direction, and a projected search to compute the step. The use of projected searches, in particular, allows TRON to examine faces of the feasible set by generating a small number of minor iterates, even for problems with a large number of variables. As a result TRON is remarkably efficient at solving large bound-constrained optimization problems.
TRON was developed by Chih-Jen Lin and Jorge J. More'. The solver was last updated on Sep/17/08 for tron v 1.2 and Adifor v 2.0.
Number of Variables:
subroutine initpt(n,x) n - integer (input) number of variables x - double precision, length n (output) starting point
subroutine fcn(n,x,nf,f) n - integer (input) number of variables x - double precision, length n (input) vector of variables nf - integer (input) number of element functions f - double precision, length nf (output) element functions at x
subroutine xbound(n,xl,xu) n - integer (input) number of variables xl - double precision, length n (output) lower bound xu - double precision, length n (output) upper bound (If x(i) has no lower bound, then do not assign a value to xl(i), similarly if x(i) has no upper bound, then xu(i) should not be set.)
DOE disclaimer DOE Web privacy policy