A modular system of algorithms for unconstrained minimization
ACM Transactions on Mathematical Software (TOMS)
Direct methods for sparse matrices
Direct methods for sparse matrices
More test examples for nonlinear programming codes
More test examples for nonlinear programming codes
A strategy for global convergence in a sequential quadratic programming algorithm
SIAM Journal on Numerical Analysis
On large scale nonlinear network optimization
Mathematical Programming: Series A and B
On the limited memory BFGS method for large scale optimization
Mathematical Programming: Series A and B
Algorithm 709: testing algorithm implementations
ACM Transactions on Mathematical Software (TOMS)
Testing Unconstrained Optimization Software
ACM Transactions on Mathematical Software (TOMS)
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A)
Test Examples for Nonlinear Programming Codes
Test Examples for Nonlinear Programming Codes
ACM Transactions on Mathematical Software (TOMS)
Optimization of custom MOS circuits by transistor sizing
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
ACM Transactions on Mathematical Software (TOMS)
Numerical Experiences with New Truncated Newton Methodsin Large Scale Unconstrained Optimization
Computational Optimization and Applications
Optimization techniques for high-performance digital circuits
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Generating box-constrained optimization problems
ACM Transactions on Mathematical Software (TOMS)
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
ACM Transactions on Mathematical Software (TOMS)
Algorithm 813: SPG—Software for Convex-Constrained Optimization
ACM Transactions on Mathematical Software (TOMS)
On the Behavior of the Gradient Norm in the Steepest Descent Method
Computational Optimization and Applications
Enriched Methods for Large-Scale Unconstrained Optimization
Computational Optimization and Applications
A New Trust-Region Algorithm for Equality Constrained Optimization
Computational Optimization and Applications
Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients
Computational Optimization and Applications
Nonmonotone Globalization Techniques for the Barzilai-Borwein Gradient Method
Computational Optimization and Applications
Computational Optimization and Applications
Inertia-controlling factorizations for optimization algorithms
Applied Numerical Mathematics
Feasible Interior Methods Using Slacks for Nonlinear Optimization
Computational Optimization and Applications
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
ACM Transactions on Mathematical Software (TOMS)
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited
ACM Transactions on Mathematical Software (TOMS)
Computational Optimization and Applications
SIPAMPL: Semi-infinite programming with AMPL
ACM Transactions on Mathematical Software (TOMS)
MA57---a code for the solution of sparse symmetric definite and indefinite systems
ACM Transactions on Mathematical Software (TOMS)
Numerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming
Computational Optimization and Applications
Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent
ACM Transactions on Mathematical Software (TOMS)
Convergence of nonmonotone line search method
Journal of Computational and Applied Mathematics
A Modified Quasi-Newton Method for Structured Optimization with Partial Information on the Hessian
Computational Optimization and Applications
Computational Optimization and Applications
Simulated annealing with asymptotic convergence for nonlinear constrained optimization
Journal of Global Optimization
Improving solver success in reaching feasibility for sets of nonlinear constraints
Computers and Operations Research
Computing sparse Hessians with automatic differentiation
ACM Transactions on Mathematical Software (TOMS)
Scaled conjugate gradient algorithms for unconstrained optimization
Computational Optimization and Applications
Computational Optimization and Applications
Self-adaptive inexact proximal point methods
Computational Optimization and Applications
Two descent hybrid conjugate gradient methods for optimization
Journal of Computational and Applied Mathematics
A limited memory BFGS-type method for large-scale unconstrained optimization
Computers & Mathematics with Applications
Sprouting search-an algorithmic framework for asynchronous parallel unconstrained optimization
Optimization Methods & Software
Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
Optimization Methods & Software
A nonmonotone semismooth inexact Newton method
Optimization Methods & Software
Some descent three-term conjugate gradient methods and their global convergence
Optimization Methods & Software
Affine conjugate adaptive Newton methods for nonlinear elastomechanics
Optimization Methods & Software
Optimization Methods & Software - Dedicated to Professor Michael J.D. Powell on the occasion of his 70th birthday
Optimization Methods & Software - Mathematical programming in data mining and machine learning
Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
Journal of Computational and Applied Mathematics
A new family of conjugate gradient methods
Journal of Computational and Applied Mathematics
Another nonlinear conjugate gradient algorithm for unconstrained optimization
Optimization Methods & Software
A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Global convergence of quasi-Newton methods based on adjoint Broyden updates
Applied Numerical Mathematics
Journal of Computational and Applied Mathematics
A globally convergent BFGS method with nonmonotone line search for non-convex minimization
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Computers & Mathematics with Applications
Notes on the Dai-Yuan-Yuan modified spectral gradient method
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Improved Hessian approximation with modified secant equations for symmetric rank-one method
Journal of Computational and Applied Mathematics
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians
SIAM Journal on Optimization
A Subspace Minimization Method for the Trust-Region Step
SIAM Journal on Optimization
A modified CG-DESCENT method for unconstrained optimization
Journal of Computational and Applied Mathematics
Modified nonmonotone Armijo line search for descent method
Numerical Algorithms
Journal of Mathematical Modelling and Algorithms
Derivative-free nonlinear optimization filter simplex
International Journal of Applied Mathematics and Computer Science
A working set SQCQP algorithm with simple nonmonotone penalty parameters
Journal of Computational and Applied Mathematics
An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
SIAM Journal on Scientific Computing
SIAM Journal on Optimization
A primal-dual augmented Lagrangian
Computational Optimization and Applications
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Computers & Mathematics with Applications
Generalizations of the limited-memory BFGS method based on the quasi-product form of update
Journal of Computational and Applied Mathematics
Evaluating bound-constrained minimization software
Computational Optimization and Applications
Descentwise inexact proximal algorithms for smooth optimization
Computational Optimization and Applications
NLEVP: A Collection of Nonlinear Eigenvalue Problems
ACM Transactions on Mathematical Software (TOMS)
Global and local convergence of a penalty-free method for nonlinear programming
Computers & Mathematics with Applications
An improved infeasible SSLE method for constrained optimization without strict complementarity
Computers and Operations Research
Spectral-scaling quasi-Newton methods with updates from the one parameter of the Broyden family
Journal of Computational and Applied Mathematics
Computing the sparsity pattern of Hessians using automatic differentiation
ACM Transactions on Mathematical Software (TOMS)
A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
Computational Optimization and Applications
Journal of Computational and Applied Mathematics
An active set truncated Newton method for large-scale bound constrained optimization
Computers & Mathematics with Applications
Hi-index | 0.01 |
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.