Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1994)
Nick Gould
I. Duff, A. Erisman, J. Reid (1987)
Direct Methods for Sparse Matrices
Bobby Schnabel, T. Chow (1991)
Tensor Methods for Unconstrained Optimization Using Second DerivativesSIAM J. Optim., 1
(1993)
A Catalogue of Subroutines CRelease 11)
(1992)
and Ph
(1983)
Test problems for partially separable optimization and results for the routine PSPMIN
J. Moré, G. Toraldo (1991)
On the Solution of Large Quadratic Programming Problems with Bound ConstraintsSIAM J. Optim., 1
Dong Liu, J. Nocedal (1989)
On the limited memory BFGS method for large scale optimizationMathematical Programming, 45
(1983)
Technical Report 83/4
B. Averick, R. Carter, J. Moré (1991)
The MINPACK-2 test problem collection (preliminary version)
A. Buckley (1992)
Algorithm 709: testing algorithm implementationsACM Trans. Math. Softw., 18
Bobby Schnabel, J. Koontz, Barry Weiss (1985)
A modular system of algorithms for unconstrained minimizationACM Trans. Math. Softw., 11
(1993)
Harwell Subroutine Library. A catalogue of subroutines (release 11) Advanced Computing Department
A. Conn, N. Gould, P. Toint (1992)
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
B. Murtagh, M. Saunders (1978)
Large-scale linearly constrained optimizationMathematical Programming, 14
(1985)
Optimization Subroutine Library: Guide and Reference, SC23-0519-1. IBM Corporation, second edition
A. Griewank, P. Toint (1982)
On the unconstrained optimization of partially separable functions
A. Conn, N. Gould, P. Toint (1994)
A note on using alternative second-order models for the subproblems arising in barrier function methods for minimizationNumerische Mathematik, 68
Willi Hock, K. Schittkowski (1980)
Test examples for nonlinear programming codesJournal of Optimization Theory and Applications, 30
(1977)
Toint . An introduction to the structure of large scale nonlinear optimization problems and the LANCELOT project
(1990)
Algorithms for Nonlinear Least Squares with Applications to Orthogonal Regression
Math. Program
Willi Hock, K. Schittkowski (1985)
Lecture Notes in Economics and Mathematical Systems
(1993)
The MathWorks, Inc
B. Averick, R. Carter, G. Xue, J. Moré (1992)
The MINPACK-2 test problem collection
(1982)
editor
(1993)
Complete Numerical Results for LANCELOT Release A
(1992)
Intensive numerical tests
(1993)
Release 4
J. Moré, G. Toraldo (1989)
Algorithms for bound constrained quadratic programming problemsNumerische Mathematik, 55
(1995)
ACM Transactions on Mathematical Software ACM Trans. Math. Softw
P. Toint, D. Tuyttens (1990)
On large scale nonlinear Network optimizationMathematical Programming, 48
D. Bell (1979)
Numerical Methods for Unconstrained OptimizationElectronics and Power, 25
(1990)
International Business Machines Corporation, 1990] International Business Machines Corporation . Optimization Subroutine Library : Guide and Reference, second edition
K. Schittkowski (1981)
More test examples for nonlinear programming codes
(1985)
Mathematical Programming Society COAL Newsletter
P. Boggs, J. Tolle (1989)
A strategy for global convergence in a sequential quadratic programming algorithmSIAM Journal on Numerical Analysis, 26
M. Powell (1994)
A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation
(1989)
Series B
(1985)
Electronic mail distribution of linear programming test problems
A. Conn, N. Gould, P. Toint (1996)
Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimizationMathematical Programming, 73
サイバネットシステム (1994)
MATLAB : high-performance numeric computation and visualization software : エクスターナルインタフェースガイド
(1978)
International Business Machines Corporation . Mathematical programming system extended (MPSX) and generalized upper bounding (GUB)
P. Gill, W. Murray, M. Saunders, M. Wright (1984)
User''s guide for NPSOL (Ver-sion 4.0): A FORTRAN package for nonlinear programming
J. Bus (1977)
A proposal for the classification and documentation of test problems in the field of nonlinear programming : (preprint)
(1993)
Saunders
P. Toint, D. Tuyttens (1992)
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problemsACM Trans. Math. Softw., 18
(1987)
MINOS 5.1 USER'S GUIDE
J. Moré, B. Garbow, K. Hillstrom (1981)
Testing Unconstrained Optimization SoftwareACM Trans. Math. Softw., 7
R. Dembo (1987)
A primal truncated newton algorithm with application to large-scale nonlinear network optimization, 31
N. Gould (1991)
An Algorithm for Large-Scale Quadratic ProgrammingIma Journal of Numerical Analysis, 11
J. Dennis, Bobby Schnabel (1983)
Numerical methods for unconstrained optimization and nonlinear equations
(1982)
Extensions to subroutine VF02
The purpose of this article is to discuss the scope and functionality of a versatile environment for testing small- and large-scale nonlinear optimization algorithms. Although many of these facilities were originally produced by the authors in conjunction with the software package LANCELOT, we believe that they will be useful in their own right and should be available to researchers for their development of optimization software. The tools can be obtained by anonymous ftp from a number of sources and may, in many cases, be installed automatically. The scope of a major collection of test problems written in the standard input format (SIF) used by the LANCELOT software package is described. Recognizing that most software was not written with the SIF in mind, we provide tools to assist in building an interface between this input format and other optimization packages. These tools provide a link between the SIF and a number of existing packages, including MINOS and OSL. Additionally, as each problem includes a specific classification that is designed to be useful in identifying particular classes of problems, facilities are provided to build and manage a database of this information. There is a Unix and C shell bias to many of the descriptions in the article, since, for the sake of simplicity, we do not illustrate everything in its fullest generality. We trust that the majority of potential users are sufficiently familiar with Unix that these examples will not lead to undue confusion.
ACM Transactions on Mathematical Software (TOMS) – Association for Computing Machinery
Published: Mar 1, 1995
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.