Pages that link to "Item:Q3093044"
From MaRDI portal
The following pages link to Interval computations, rigour and non-rigour in deterministic continuous global optimization (Q3093044):
Displaying 14 items.
- On smooth reformulations and direct non-smooth computations for minimax problems (Q386469) (← links)
- Solving set-valued constraint satisfaction problems (Q411438) (← links)
- Testing pseudoconvexity via interval computation (Q721159) (← links)
- Rigorous global search: continuous problems (Q1353367) (← links)
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method (Q2018467) (← links)
- Linear interval parametric approach to testing pseudoconvexity (Q2022238) (← links)
- On rigorous upper bounds to a global optimum (Q2250091) (← links)
- First order rejection tests for multiple-objective optimization (Q2250111) (← links)
- A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
- A branch and bound algorithm for quantified quadratic programming (Q2397427) (← links)
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization (Q3423591) (← links)
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (Q5746707) (← links)
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices (Q5964239) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)