Foundations of global optimization

DOI10.1007/978-3-662-55360-2MaRDI QIDQ4600380zbMATH OpenOpenAlexFDO

Authors 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 matrixinterval mathematicsLipschitz propertieslocal and global solutionsnon-convex optimization problemsWeierstraß theorem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 47153
• scientific article; zbMATH DE number 1795203
• scientific article; zbMATH DE number 193463
• Global optimization. Theory, algorithms, and applications
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems

Cited in

(7)

• Simplicial algorithms for minimizing polyhedral functions
• Approximation and non-linear optimization through practical problems. Applications from finance and location planning
• Foundations of global optimization
• Foundations of Optimization
• Quasiconvex relaxations based on interval arithmetic
• Globally optimal univariate spline approximations
• Basic concepts of global optimization

This page was built for publication: Foundations of global optimization

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