Generation of large-scale quadratic programs for use as global optimization test problems

Authors:
Panos M. Pardalos
Affiliations:
Pennsylvania State Univ., University Park
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1987

Citing 4
Cited 6

Construction of large-scale global minimum concave quadratic test problems

Journal of Optimization Theory and Applications
Global minimization of large-scale constrained concave quadratic problems by separable programming

Mathematical Programming: Series A and B
Methods for global concave minimization: A bibliographic survey

SIAM Review
Randomly Generated Test Problems for Positive Definite Quadratic Programming

ACM Transactions on Mathematical Software (TOMS)

Construction of test problems in quadratic bivalent programming

ACM Transactions on Mathematical Software (TOMS)
A test problem generator for the Steiner problem in graphs

ACM Transactions on Mathematical Software (TOMS)
Test Functions with Variable Attraction Regions for GlobalOptimization Problems

Journal of Global Optimization
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)
A new class of test functions for global optimization

Journal of Global Optimization
Behavior of DCA sequences for solving the trust-region subproblem

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method is presented for the generation of test problems for global optimization algorithms. Givena bounded polyhedron in R and a vertex, the method constructs nonconvex quadratic functions(concave or indefinite) whose global minimum is attained at the selected vertex. The constructionrequires only the use of linear programming and linear systems of equations.