Generation of large-scale quadratic programs for use as global optimization test problems
From MaRDI portal
Recommendations
- Construction of large-scale global minimum concave quadratic test problems
- A new technique for generating quadratic programming test problems
- Construction of test problems in quadratic bivalent programming
- On generating nonconvex optimization test problems
- Test problem generator for unconstrained global optimization
Cited in
(25)- A collection of test problems for constrained global optimization algorithms
- Generating quadratic assignment test problems with known optimal permutations
- Construction of test problems for concave minimization under linear and nonlinear constraints
- Handbook of test problems in local and global optimization
- 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
- Test problem generator by neural network for algorithms that try solving nonlinear programming problems globally
- Test problem construction for linear bilevel programming problems
- On the use of optimization models for portfolio selection: A review and some computational results
- On generating nonconvex optimization test problems
- Construction of large-scale global minimum concave quadratic test problems
- A new class of test functions for global optimization
- Computational experience using an edge search algorithm for linear reverse convex programs
- Randomly Generated Test Problems for Positive Definite Quadratic Programming
- Test problem generator for unconstrained global optimization
- Behavior of DCA sequences for solving the trust-region subproblem
- Constructing test functions for global optimization using continuous formulations of graph problems
- On the chromatic number of graphs
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- A level set algorithm for a class of reverse convex programs
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Active constraints, indefinite quadratic test problems, and complexity
This page was built for publication: Generation of large-scale quadratic programs for use as global optimization test problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028740)