Construction of large-scale global minimum concave quadratic test problems

DOI10.1007/BF00940675zbMath0559.90066OpenAlexW2049966901MaRDI QIDQ2265952

J. Ben Rosen, Bahman Kalantari

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940675

zbMATH Keywords

concave minimizationtestingknown global solutionslarge-scale global minimization test problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)

Related Items (9)

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 ⋮ Global minimization of large-scale constrained concave quadratic problems by separable programming ⋮ Study of multiscale global optimization based on parameter space partition ⋮ A new class of test functions for global optimization ⋮ Construction of test problems for concave minimization under linear and nonlinear constraints ⋮ Computational experience using an edge search algorithm for linear reverse convex programs ⋮ A new technique for generating quadratic programming test problems

Cites Work

• Unnamed Item
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• Concave Minimization Via Collapsing Polytopes
• A Successive Underestimation Method for Concave Minimization Problems
• Global minimum test problem construction

This page was built for publication: Construction of large-scale global minimum concave quadratic test problems