A generalization of the construction of test problems for nonconvex optimization
From MaRDI portal
Publication:1330804
DOI10.1007/BF01097001zbMath0824.90114OpenAlexW1976912467MaRDI QIDQ1330804
Publication date: 11 August 1994
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01097001
Related Items (3)
Construction of test problems for concave minimization under linear and nonlinear constraints ⋮ Test problem construction for linear bilevel programming problems ⋮ Computational experience using an edge search algorithm for linear reverse convex programs
Cites Work
- A level set algorithm for a class of reverse convex programs
- A collection of test problems for constrained global optimization algorithms
- Construction of large-scale global minimum concave quadratic test problems
- Generation of large-scale quadratic programs for use as global optimization test problems
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- A Successive Underestimation Method for Concave Minimization Problems
- Global minimum test problem construction
This page was built for publication: A generalization of the construction of test problems for nonconvex optimization
