Validated Linear Relaxations and Preprocessing: Some Experiments

DOI10.1137/030602186zbMath1122.90075OpenAlexW1966164803MaRDI QIDQ5470202

Siriporn Hongthong, Ralph Baker Kearfott

Publication date: 30 May 2006

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/030602186

zbMATH Keywords

computational complexityglobal optimizationsymbolic computationnonconvex optimizationautomatic differentiationlinear relaxationGlobSol

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items

Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ A general framework for convexity analysis in deterministic global optimization ⋮ An efficient and safe framework for solving optimization problems ⋮ On smooth reformulations and direct non-smooth computations for minimax problems ⋮ Rigorous filtering using linear relaxations ⋮ A reliable affine relaxation method for global optimization ⋮ Mathematically Rigorous Global Optimization and Fuzzy Optimization ⋮ A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems ⋮ Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces

This page was built for publication: Validated Linear Relaxations and Preprocessing: Some Experiments