Performance of approximate algorithms for global minimization

DOI10.1007/BFb0121019zbMath0554.90085MaRDI QIDQ3217953

J. Ben Rosen

Publication date: 1984

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

zbMATH Keywords

computational complexitylinear constraintsbranch and bound algorithmsglobal minimizationcomputational analysisepsilon-approximate solution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Deterministic methods in constrained global optimization: Some recent advances and new fields of application, Global minimization of large-scale constrained concave quadratic problems by separable programming