E04MZF | Converts MPSX data file defining LP or QP problem to format required by E04NKF |

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

E04NFF | QP problem (dense) |

E04NKF | LP or QP problem (sparse) |

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

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

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

H02CBF | Integer QP problem (dense) |

H02CEF | Integer LP or QP problem (sparse) |

Library Contents

Keywords in Context Index

© The Numerical Algorithms Group Ltd, Oxford UK. 2001