a00aa | a00aa: Library identification, details of implementation and mark |

e04ab | e04ab: Minimum, function of one variable using function values only |

e04bb | e04bb: Minimum, function of one variable, using first derivative |

e04cc | e04cc: Unconstrained minimum, simplex algorithm, function of several variables using function values only (comprehensive) |

e04dg | e04dg: Unconstrained minimum, preconditioned conjugate gradient algorithm, function of several variables using first derivatives (comprehensive) |

e04fy | e04fy: Unconstrained minimum of a sum of squares, combined Gauss-Newton and modified Newton algorithm using function values only (easy-to-use) |

e04gy | e04gy: Unconstrained minimum of a sum of squares, combined Gauss-Newton and quasi-Newton algorithm, using first derivatives (easy-to-use) |

e04gz | e04gz: Unconstrained minimum of a sum of squares, combined Gauss-Newton and modified Newton algorithm using first derivatives (easy-to-use) |

e04hc | e04hc: Check user's function for calculating first derivatives of function |

e04hd | e04hd: Check user's function for calculating second derivatives of function |

e04hy | e04hy: Unconstrained minimum of a sum of squares, combined Gauss-Newton and modified Newton algorithm, using second derivatives (easy-to-use) |

e04jy | e04jy: Minimum, function of several variables, quasi-Newton algorithm, simple bounds, using function values only (easy-to-use) |

e04kd | e04kd: Minimum, function of several variables, modified Newton algorithm, simple bounds, using first derivatives (comprehensive) |

e04ky | e04ky: Minimum, function of several variables, quasi-Newton algorithm, simple bounds, using first derivatives (easy-to-use) |

e04kz | e04kz: Minimum, function of several variables, modified Newton algorithm, simple bounds, using first derivatives (easy-to-use) |

e04lb | e04lb: Minimum, function of several variables, modified Newton algorithm, simple bounds, using first and second derivatives (comprehensive) |

e04ly | e04ly: Minimum, function of several variables, modified Newton algorithm, simple bounds, using first and second derivatives (easy-to-use) |

e04nc | e04nc: Convex QP problem or linearly-constrained linear least squares problem (dense) |

e04nf | e04nf: QP problem (dense) |

e04nk | e04nk: LP or QP problem (sparse) |

e04uc | e04uc: Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (comprehensive) |

e04uf | e04uf: Minimum, function of several variables, sequential QP method, nonlinear constraints, using function values and optionally first derivatives (reverse communication, comprehensive) |

e04ug | e04ug: NLP problem (sparse) |

e04us | e04us: Minimum of a sum of squares, nonlinear constraints, sequential QP method, using function values and optionally first derivatives (comprehensive) |

NAGFWrappers | Provides interfaces to NAG Fortran Library |