Pages that link to "Item:Q3423591"
From MaRDI portal
The following pages link to Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization (Q3423591):
Displayed 9 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- On smooth reformulations and direct non-smooth computations for minimax problems (Q386469) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs (Q534256) (← links)
- An efficient and safe framework for solving optimization problems (Q861905) (← links)
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations (Q2357903) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- Validated constraints solving --- practicalities, pitfalls, and new developments (Q2568645) (← links)
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (Q5746707) (← links)