Generation of large-scale quadratic programs for use as global optimization test problems
From MaRDI portal
Publication:3028740
DOI10.1145/328512.328516zbMath0625.90080OpenAlexW1964842336WikidataQ111900086 ScholiaQ111900086MaRDI QIDQ3028740
Publication date: 1987
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1987-13/
Related Items
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, On the use of optimization models for portfolio selection: A review and some computational results, Test problem generator for unconstrained global optimization, Active constraints, indefinite quadratic test problems, and complexity, Behavior of DCA sequences for solving the trust-region subproblem, A new class of test functions for global optimization, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, Generating quadratic assignment test problems with known optimal permutations, On the chromatic number of graphs, Construction of test problems for concave minimization under linear and nonlinear constraints, A level set algorithm for a class of reverse convex programs, Test problem construction for linear bilevel programming problems, Computational experience using an edge search algorithm for linear reverse convex programs, A new technique for generating quadratic programming test problems, Global optimization algorithms for linearly constrained indefinite quadratic problems
