TRON

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'.

Using the NEOS Server for TRON

The user must submit a model in AMPL format to solve a bound constrained optimization problem. Examples of models in AMPL format can be found in the netlib collection. The model is specified by a model file, and optionally, a data file and a commands file. If the command file is specified it must contain the AMPL solve command. The commands file can contain any AMPL command or set options for TRON. Printing directed to standard out is returned to the user with the output.

Enter the location of the ampl model (local file)
Model File:

Enter the location of the ampl data file (local file)
Data File:

Enter the location of the ampl commands file (local file)
Commands File:

Comments:

Put in priority queue

e-mail address:

Please do not click the 'Submit to NEOS' button more than once.

_{DOE disclaimer

DOE Web privacy policy}