|
Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > Optimization (G.1.6) > Unconstrained Optimization (G.1.6...)
|
|
|
|
|
|
|
|
|
1-4 of 4
Reviews about "Unconstrained Optimization (G.1.6...)":
|
Date Reviewed |
|
Algorithm 897: VTDIRECT95: serial and parallel codes for the global optimization algorithm direct He J., Watson L., Sosonkina M. ACM Transactions on Mathematical Software 36(3): 1-24, 2009. Type: Article
With faster processors and more software packages to implement parallel algorithms, researchers are solving larger optimization problems, involving many parameters and very complex merit functions. Moreover, software packages such as t...
|
Sep 17 2009 |
|
On stopping criteria in verified nonlinear systems or optimization algorithms Kearfott R., Walster G. ACM Transactions on Mathematical Software 26(3): 373-389, 2000. Type: Article
The basic tool in the verified solution of constrained or unconstrained optimization or root-finding problems is the interval Newton method. Analogues of conventional termination criteria can be problematic, potentially leading to inad...
|
Dec 1 2000 |
|
Algorithm 765: STENMIN--a software package for large, sparse unconstrained optimization using tensor methods Bouaricha A. ACM Transactions on Mathematical Software 23(1): 81-90, 1997. Type: Article
The STENMIN software package solves unconstrained optimization problems using an algorithm based on a tensor model, originally proposed by Schnabel and Chow, with order 1, that is, the model interpolates the last function value and gra...
|
Nov 1 1997 |
|
A modular system of algorithms for unconstrained minimization Schnabel R. (ed), Koonatz J., Weiss B. ACM Transactions on Mathematical Software 11(4): 419-440, 1985. Type: Article
This paper describes UNCMIN, a modular system of FORTRAN subroutines for solving where x is an n-dimensional vector and f i...
|
Feb 1 1987 |
|
|
|
|
|