Construction of large-scale global minimum concave quadratic test problems
Construction of problems with known global solutions is important for the computational testing of constrained global minimization algorithms. In this paper, it is shown how to construct a concave quadratic function which attains its global minimum at a specified vertex of a polytope in \(R^{n+k}\). The constructed function is strictly concave in the variables \(x\in R^ n\) and is linear in the variables \(y\in R^ k\). The number of linear variables k may be much larger than n, so that large- scale global minimization test problems can be constructed by the methods described here.
- On the construction of test problems for concave minimization algorithms
- Generation of large-scale quadratic programs for use as global optimization test problems
- Construction of test problems for concave minimization under linear and nonlinear constraints
- scientific article; zbMATH DE number 3913569
- Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
- A Successive Underestimation Method for Concave Minimization Problems
- Concave Minimization Via Collapsing Polytopes
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Global minimum test problem construction
- scientific article; zbMATH DE number 3215121 (Why is no real title available?)
- Construction of test problems for concave minimization under linear and nonlinear constraints
- Test functions with variable attraction regions for global optimization problems
- A new technique for generating quadratic programming test problems
- A generalization of the construction of test problems for nonconvex optimization
- Construction of test problems for a class of reverse convex programs
- On the construction of test problems for concave minimization algorithms
- The quadratic M-convexity testing problem
- A new class of test functions for global optimization
- Computational experience using an edge search algorithm for linear reverse convex programs
- Generation of large-scale quadratic programs for use as global optimization test problems
- Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Study of multiscale global optimization based on parameter space partition
This page was built for publication: Construction of large-scale global minimum concave quadratic test problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265952)
