Abstract
In this paper we adopt and generalize the basic idea of the method presented in [3] and [4] to construct test problems that involve arbitrary, not necessarily quadratic, concave functions, for both Concave Minimization and Reverse Convex Programs
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BenSaad, S. and Jacobsen, S. E. (1990), A Level Set Algorithm for a Class of Reverse Convex Programs,Annals of Operations Research 25, 19–42.
Falk, J. E. and Hoffman, K. L. (1976), A Successive Underestimation Method for Concave Minimization Problems,Mathematics of Operations Research 1(3), 251–259.
Kalantari, B. and Rosen, J. B. (1986), Construction of Large-Scale Global Minimum Concave Quadratic Test Problems,Journal of Optimization Theory and Applications 48, 303–313.
Pardalos, P. M. (1987), Generation of Large-Scale Quadratic Programs for Use as Global Optimization Test Problems,ACM Transaction on Mathematical Software 13(2), 143–147.
Floudas, C. A. and Pardalos, P. M. (1990), A Collection of Test Problems for Constrained Global Optimization Algorithms,Springer Verlag Lecture Notes in Computer Science 455.
Sung, Y. and Rosen, J. B. (1982), Global Minimum Test Problem Construction,Mathematical Programming 24, 353–355.
Rosen, J. B. (1983), Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain,Mathematics of Operations Research 8(2), 215–230.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Moshirvaziri, K. A generalization of the construction of test problems for nonconvex optimization. J Glob Optim 5, 21–34 (1994). https://doi.org/10.1007/BF01097001
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01097001