A general framework for convexity analysis in deterministic global optimization

DOI10.1007/S10898-012-9905-4MaRDI QIDQ2392103zbMATH OpenOpenAlexFDO

Authors Jessie Castille, Gaurav Tyagi, Ralph Baker Kearfott

Publication date 1 August 2013

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-012-9905-4

zbMATH Keywords

automatic differentiationautomatic verificationbranch and bound algorithmscomplete searchinterval analysisnonconvexity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
• Convex Programming Methods for Global Optimization
• Convexity and concavity detection in computational graphs: tree walks for convexity assessment
• Global optimization of nonconvex problems with convex-transformable intermediates
• Convex-concave programming as a decomposition approach to global optimization

Cites work

• A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
• A reduced space branch and bound algorithm for global optimization.
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
• Benchmarking global optimization and constraint satisfaction codes
• Branching and bounds tighteningtechniques for non-convex MINLP
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• GlobSol user guide
• scientific article; zbMATH DE number 992807 (Why is no real title available?)
• scientific article; zbMATH DE number 1456803 (Why is no real title available?)
• Interval analysis on directed acyclic graphs for global optimization
• Interval computations, rigour and non-rigour in deterministic continuous global optimization
• Safe bounds in linear and mixed-integer linear programming
• Validated Linear Relaxations and Preprocessing: Some Experiments

Cited in

(3)

• A review of computation of mathematically rigorous bounds on optima of linear programs
• Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces

Describes a project that uses

Uses Software

• GlobSol
• COCONUT

This page was built for publication: A general framework for convexity analysis in deterministic global optimization

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