Validated Linear Relaxations and Preprocessing: Some Experiments
From MaRDI portal
Recommendations
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Linearity embedded in nonconvex programs
- A polyhedral branch-and-cut approach to global optimization
- Construction of convex relaxations using automated code generation techniques
- A reliable affine relaxation method for global optimization
Cited in
(14)- Construction of convex relaxations using automated code generation techniques
- Experimental validation of volume-based comparison for double-McCormick relaxations
- A general framework for convexity analysis in deterministic global optimization
- Validated constraints solving --- practicalities, pitfalls, and new developments
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- 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
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- Hybridizing two linear relaxation techniques in interval-based solvers
- An efficient and safe framework for solving optimization problems
- A comparison of some methods for bounding connected and disconnected solution sets of interval linear systems
This page was built for publication: Validated Linear Relaxations and Preprocessing: Some Experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470202)
