Enumerating Delaunay partitions and global optimization

MaRDI QIDQ2948425zbMATH OpenFDO

Authors James E. Falk

Publication date 30 September 2015

zbMATH Keywords

Delaunay partitionspiecewise linear nonconvex optimization

Mathematics Subject Classification ID

Linear programming (90C05) Nonconvex programming, global optimization (90C26)

Recommendations

• Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
• A nonconvex, piecewise linear optimization problem
• On a global optimization algorithm for bivariate smooth functions
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
• Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints

Cited in

(3)

• TRIOPT: A triangulation-based partitioning algorithm for global optimization
• DELAUNAY PARTITIONING IN THREE DIMENSIONS AND SEMICONDUCTOR MODELS
• Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems

This page was built for publication: Enumerating Delaunay partitions and global optimization

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