Global minimum test problem construction

DOI10.1007/BF01585116zbMath0509.90067OpenAlexW2045981716MaRDI QIDQ4749608

Yuan Y. Sung, J. Ben Rosen

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

linear constraintsobjective functionglobal minimizationpolyhedral domaintest problem constructionquadratic concave

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (11)

A generalization of the construction of test problems for nonconvex optimization ⋮ New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ Construction of test problems for a class of reverse convex programs ⋮ A successive linear approximation algorithm for the global minimization of a concave quadratic program ⋮ On the construction of test problems for concave minimization algorithms ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ Construction of large-scale global minimum concave quadratic test problems ⋮ Construction of test problems for concave minimization under linear and nonlinear constraints ⋮ A level set algorithm for a class of reverse convex programs ⋮ Computational experience using an edge search algorithm for linear reverse convex programs ⋮ A new technique for generating quadratic programming test problems

Cites Work

• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• An algorithm for nonconvex programming problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• A Successive Underestimation Method for Concave Minimization Problems

This page was built for publication: Global minimum test problem construction