Construction of large-scale global minimum concave quadratic test problems

DOI10.1007/BF00940675zbMATH Open0559.90066OpenAlexW2049966901MaRDI QIDQ2265952FDOQ2265952

Authors: Bahman Kalantari, J. B. Rosen 

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

Recommendations

• 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

zbMATH Keywords

testingconcave minimizationknown 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)

Cites Work

• Title not available (Why is that?)
• A Successive Underestimation Method for Concave Minimization Problems
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• Global minimum test problem construction
• Concave Minimization Via Collapsing Polytopes

Cited In (12)

• A new class of test functions for global optimization
• Generation of large-scale quadratic programs for use as global optimization test problems
• A generalization of the construction of test problems for nonconvex optimization
• Construction of test problems for a class of reverse convex programs
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
• Study of multiscale global optimization based on parameter space partition
• Computational experience using an edge search algorithm for linear reverse convex programs
• A new technique for generating quadratic programming test problems
• The quadratic M-convexity testing problem
• On the construction of test problems for concave minimization algorithms
• Construction of test problems for concave minimization under linear and nonlinear constraints

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)