Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces

DOI10.1080/10556788.2013.780058zbMath1282.90136OpenAlexW2006261563MaRDI QIDQ5746707

Jessie Castille, Gaurav Tyagi, Ralph Baker Kearfott

Publication date: 7 February 2014

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2013.780058

zbMATH Keywords

non-convex optimizationbranch and bound algorithmslinear relaxations

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods of relaxation type (49M20)

Related Items

A general framework for convexity analysis in deterministic global optimization, Mathematically Rigorous Global Optimization and Fuzzy Optimization, On rigorous upper bounds to a global optimum

Uses Software

• Slatec
• Benchmarks for Optimization Software
• COCONUT
• GlobSol

Cites Work

• A reliable affine relaxation method for global optimization
• A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
• Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
• A reduced space branch and bound algorithm for global optimization.
• A general framework for convexity analysis in deterministic global optimization
• Erratum: Validated Linear Relaxations and Preprocessing: Some Experiments
• Interval computations, rigour and non-rigour in deterministic continuous global optimization
• GlobSol user guide
• Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
• Validated Linear Relaxations and Preprocessing: Some Experiments