Generating box-constrained optimization problems

Authors:
Francisco Facchinei;Joaquim Júdice;João Soares
Affiliations:
Univ. di Roma “La Sapienza”, Rome, Italy;Univ. de Coimbra, Coimbra, Portugal;Univ. de Coimbra, Coimbra, Portugal
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1997

Citing 7
Cited 3

On generating test problems for nonlinear programming algorithms

SIAM Journal on Scientific and Statistical Computing
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations

Journal of Optimization Theory and Applications
CUTE: constrained and unconstrained testing environment

ACM Transactions on Mathematical Software (TOMS)
Algorithm 774: Fortran subroutines for generating box-constrained optimization problems

ACM Transactions on Mathematical Software (TOMS)
Testing Unconstrained Optimization Software

ACM Transactions on Mathematical Software (TOMS)
Pracniques: construction of nonlinear programming test problems

Communications of the ACM
Test Examples for Nonlinear Programming Codes

Test Examples for Nonlinear Programming Codes

Algorithm 774: Fortran subroutines for generating box-constrained optimization problems

ACM Transactions on Mathematical Software (TOMS)
Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization

ACM Transactions on Mathematical Software (TOMS)
Study of multiscale global optimization based on parameter space partition

Journal of Global Optimization

Quantified Score

Hi-index	0.03

Visualization

Abstract

We present a method for generating box-constrained nonlinear programming test problems. The technique allows the user to control some properties of the generated test problems that are know to influence the behavior of algorithms for their solution. A corresponding set of Fortran 77 routines is described in a companion algorithm (774).