Grundzüge der Globalen Optimierung

DOI10.1007/978-3-662-55360-2zbMath1387.90003OpenAlexW2770291243MaRDI QIDQ4600380

Oliver Stein

Publication date: 8 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-55360-2

zbMATH Keywords

branch and boundconvex relaxationHessian matrixlocal and global solutionsinterval mathematicsnon-convex optimization problemsLipschitz propertiesWeierstraß theorem

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Methods involving semicontinuity and convergence; relaxation (49J45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Numerical methods of relaxation type (49M20)

Related Items (1)

Globally optimal univariate spline approximations

This page was built for publication: Grundzüge der Globalen Optimierung