Global minimum test problem construction

DOI10.1007/BF01585116MaRDI QIDQ4749608zbMATH OpenOpenAlexFDO

Authors Yuan Y. Sung, J. B. 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

global minimizationlinear constraintsobjective functionpolyhedral domainquadratic concavetest problem construction

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(11)

• Construction of test problems for concave minimization under linear and nonlinear constraints
• 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
• New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
• Construction of large-scale global minimum concave quadratic test problems
• Computational experience using an edge search algorithm for linear reverse convex programs
• A continuous approch for globally solving linearly constrained quadratic
• A level set algorithm for a class of reverse convex programs
• A successive linear approximation algorithm for the global minimization of a concave quadratic program

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749608)