ACM Transactions on Mathematical Software
SCOPUS (1975-2024)SCIE-ISI
1557-7295
0098-3500
Mỹ
Cơ quản chủ quản: Association for Computing Machinery (ACM) , ASSOC COMPUTING MACHINERY
Lĩnh vực:
SoftwareApplied Mathematics
Các bài báo tiêu biểu
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Tập 8 Số 1 - Trang 43-71 - 1982
Algorithm 778: L-BFGS-B
Tập 23 Số 4 - Trang 550-560 - 1997
L-BFGS-B is a limited-memory algorithm for solving large nonlinear optimization
problems subject to simple bounds on the variables. It is intended for problems
in which information on the Hessian matrix is difficult to obtain, or for large
dense problems. L-BFGS-B can also be used for unconstrained problems and in this
case performs similarly to its predessor, algorithm L-BFGS (Harwell routine
VA1...
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Tập 3 Số 3 - Trang 209-226 - 1977
A set of level 3 basic linear algebra subprograms
Tập 16 Số 1 - Trang 1-17 - 1990
This paper describes an extension to the set of Basic Linear Algebra
Subprograms. The extensions are targeted at matrix-vector operations that should
provide for efficient and portable implementations of algorithms for
high-performance computers
Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
Tập 13 Số 3 - Trang 262-280 - 1987
A new global optimization algorithm for functions of continuous variables is
presented, derived from the “Simulated Annealing” algorithm recently introduced
in combinatorial optimization. The algorithm is essentially an iterative random
search procedure with adaptive moves along the coordinate directions. It permits
uphill moves under the control of a probabilistic criterion, thus tending to
avoid...
Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
Tập 4 Số 1 - Trang 34-50 - 1978
An extended set of FORTRAN basic linear algebra subprograms
Tập 14 Số 1 - Trang 1-17 - 1988
This paper describes an extension to the set of Basic Linear Algebra
Subprograms. The extensions are targeted at matrix-vector operations that should
provide for efficient and portable implementations of algorithms for
high-performance computers.
Recipes for adjoint code construction
Tập 24 Số 4 - Trang 437-474 - 1998
Adjoint models are increasingly being developed for use in meteorology and
oceanography. Typical applications are data assimilation, model tuning,
sensitivity analysis, and determination of singular vectors. The adjoint model
computes the gradient of a cost function with respect to control variables.
Generation of adjoint code may be seen as the special case of differentiation of
algorithms in rev...
SBA
Tập 36 Số 1 - Trang 1-30 - 2009
Bundle adjustment constitutes a large, nonlinear least-squares problem that is
often solved as the last step of feature-based structure and motion estimation
computer vision algorithms to obtain optimal estimates. Due to the very large
number of parameters involved, a general purpose least-squares algorithm incurs
high computational and memory storage costs when applied to bundle adjustment.
Fortu...